Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem | Zendy

Monique Guignard | Zendy; Moshe B. Rosenwein | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem

Author(s) -

Monique Guignard,

Moshe B. Rosenwein

Publication year - 1989

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.37.4.658

Subject(s) - mathematical optimization , dual (grammatical number) , lagrangian relaxation , constraint (computer aided design) , enumeration , branch and bound , computer science , lagrangian , node (physics) , scheme (mathematics) , algorithm , mathematics , generalized assignment problem , duality gap , assignment problem , optimization problem , discrete mathematics , art , mathematical analysis , geometry , literature , structural engineering , engineering

The generalized assignment problem GAP determines the minimum cost assignment of n jobs to m agents such that each job is assigned to exactly one agent, subject to an agentu0027s capacity. Existing sol...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research