About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Interpreted as:

journal:(Management AND science) AND title:(A AND Lagrangian AND Dual-Based AND Branch-and-Bound AND Algorithm AND for AND the AND Generalized AND Multi-Assignment AND Problem)

Suggestions: Include records that partially match the query

Filter results
Access
Type
Language
Year
From DTU
Advanced
1 Journal article

A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem

Year: 1998

Language: English

ilche jnmaofdgkbp
2 Journal article

A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem

This paper develops a Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem (GMAP) which includes the well-known generalized assignment problem (GAP) as a special case. In GMAP, an object may be required to be duplicated in multiple locations. We develop

Year: 1998

Language: English

hkbicn a demgpfjol

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user