A facet generation and relaxation technique applied to an assignment problem with side constraints

DOI10.1016/0377-2217(91)90265-WMaRDI QIDQ810374zbMATHOpenAlexFDO

Authors Ronny Aboudi, Asa Hallefjord, Kurt Jörnsten

Publication date 1991

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(91)90265-w

zbMATH Keywords

side constraintsLagrangean relaxationclassroom assignmentadding of valid inequalitiesconstrained assignmentconstrained job assignmentconstraint techniques

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80)

Recommendations

• An improved bounding procedure for the constrained assignment problem
• A Lagrangean relaxation method for the constrained assignment problem
• Publication:3204330
• Some Facets for an Assignment Problem with Side Constraints
• A truncated exponential algorithm for the lightly constrained assignment problem

Cites work

• scientific article; zbMATH DE number 3943559 (Why is no real title available?)
• scientific article; zbMATH DE number 3573593 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3086789 (Why is no real title available?)
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• Some Facets for an Assignment Problem with Side Constraints

Cited in

(9)

• Efficient cuts in Lagrangean `relax-and-cut' schemes
• A capacity allocation problem with integer side constraints
• Resource assignment with preference conditions
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems
• An improved bounding procedure for the constrained assignment problem
• A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
• scientific article; zbMATH DE number 4181140 (Why is no real title available?)
• Loading tow trains ergonomically for just-in-time part supply
• Some Facets for an Assignment Problem with Side Constraints

This page was built for publication: A facet generation and relaxation technique applied to an assignment problem with side constraints

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