Resource constrained assignment problems

DOI10.1016/0166-218X(90)90099-XzbMath0688.90039OpenAlexW1985482879MaRDI QIDQ1264090

Ronny Aboudi, Kurt O. Jørnsten

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90099-x

zbMATH Keywords

valid inequalitiespolyhedral approachresource constrained assignment

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polytopes and polyhedra (52Bxx)

Related Items (5)

Algorithms for finding a \(K\)th best valued assignment ⋮ Exact solution approaches for bilevel assignment problems ⋮ A distributed exact algorithm for the multiple resource constrained sequencing problem ⋮ A constrained matching problem ⋮ Resource assignment with preference conditions

Cites Work

• A Lagrangean relaxation method for the constrained assignment problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Resource-Constrained Assignment Scheduling
• A new algorithm for the assignment problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Facets of the knapsack polytope
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• Unnamed Item

This page was built for publication: Resource constrained assignment problems