Abstract
We consider a solution method for combinatorial optimization problems based on a combination of Lagrangean relaxation and constraint generation techniques. The procedure is applied to a constrained assignment problem, where subsets of variables are specified, and variables belonging to the same subset must have the same value. The model can be applied to solve constrained job assignment or classroom assignment problems. The procedure we suggest requires only the solution of classical assignment subproblems. An illustrative numerical example is given.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 335-344 |
| Number of pages | 10 |
| Journal | European Journal of Operational Research |
| Volume | 50 |
| Issue number | 3 |
| DOIs | |
| State | Published - Feb 15 1991 |
Keywords
- Combinatorial optimization
- Lagrangean relaxation
- assignment problem
ASJC Scopus subject areas
- Computer Science(all)
- Modeling and Simulation
- Management Science and Operations Research
- Information Systems and Management
Fingerprint Dive into the research topics of 'A facet generation and relaxation technique applied to an assignment problem with side constraints'. Together they form a unique fingerprint.
Cite this
Aboudi, R., Hallefjord, Å., & Jörnsten, K. (1991). A facet generation and relaxation technique applied to an assignment problem with side constraints. European Journal of Operational Research, 50(3), 335-344. https://doi.org/10.1016/0377-2217(91)90265-W