A facet generation and relaxation technique applied to an assignment problem with side constraints
DOI10.1016/0377-2217(91)90265-WzbMATH Open0733.90059OpenAlexW1995203453MaRDI QIDQ810374FDOQ810374
Kurt Jörnsten, Asa Hallefjord, Ronny Aboudi
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
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
side constraintsLagrangean relaxationclassroom assignmentadding of valid inequalitiesconstrained assignmentconstrained job assignmentconstraint techniques
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Solving Large-Scale Zero-One Linear Programming Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Title not available (Why is that?)
- Some Facets for an Assignment Problem with Side Constraints
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- A capacity allocation problem with integer side constraints
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- Loading tow trains ergonomically for just-in-time part supply
- Some Facets for an Assignment Problem with Side Constraints
- Resource assignment with preference conditions
- An improved bounding procedure for the constrained assignment problem
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
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)
