A facet generation and relaxation technique applied to an assignment problem with side constraints
From MaRDI portal
Publication:810374
DOI10.1016/0377-2217(91)90265-WzbMath0733.90059MaRDI QIDQ810374
Asa Hallefjord, Kurt O. Jørnsten, Ronny Aboudi
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Lagrangean relaxation; side constraints; classroom assignment; adding of valid inequalities; constrained assignment; constrained job assignment; constraint techniques
90C27: Combinatorial optimization
90B80: Discrete location and assignment
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Efficient cuts in Lagrangean `relax-and-cut' schemes, A capacity allocation problem with integer side constraints, A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships