Resource constrained assignment problems

DOI10.1016/0166-218X(90)90099-XMaRDI QIDQ1264090zbMATH OpenOpenAlexFDO

Authors Ronny Aboudi, Kurt 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

polyhedral approachresource constrained assignmentvalid inequalities

Mathematics Subject Classification ID

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

Review text

This paper studies the resource constrained assignment problem from a polyhedral approach. Several classes of valid inequalities based on the properties of the knapsack and assignment polytopes are derived.

Recommendations

• Resource-Constrained Assignment Scheduling
• Restricted assignment scheduling with resource constraints
• scientific article; zbMATH DE number 1302182
• Resource-constrained assignment problems with shared resource consumption and flexible demand
• scientific article; zbMATH DE number 30946
• Resource allocation problem under single resource assignment
• scientific article; zbMATH DE number 544186
• Problems with resource allocation constraints and optimization over the efficient set
• scientific article; zbMATH DE number 4197770
• Publication:4732313

Cites work

• A Lagrangean relaxation method for the constrained assignment problem
• A new algorithm for the assignment problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Facets of the knapsack polytope
• scientific article; zbMATH DE number 3943560 (Why is no real title available?)
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• Resource-Constrained Assignment Scheduling
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(9)

• Algorithms for finding a \(K\)th best valued assignment
• A constrained matching problem
• A distributed exact algorithm for the multiple resource constrained sequencing problem
• Exact solution approaches for bilevel assignment problems
• The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem
• scientific article; zbMATH DE number 1302182 (Why is no real title available?)
• Resource-distribution via Boolean constraints
• scientific article; zbMATH DE number 5035881 (Why is no real title available?)
• Resource assignment with preference conditions

This page was built for publication: Resource constrained assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264090)