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

DOI10.1016/0377-2217(91)90265-WzbMath0733.90059OpenAlexW1995203453MaRDI QIDQ810374

Ronny Aboudi, Kurt O. Jørnsten, Asa Hallefjord

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

Lagrangean relaxationside constraintsclassroom assignmentadding of valid inequalitiesconstrained assignmentconstrained job assignmentconstraint techniques

Mathematics Subject Classification ID

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

Related Items (6)

A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ Resource assignment with preference conditions ⋮ Loading tow trains ergonomically for just-in-time part supply ⋮ Efficient cuts in Lagrangean `relax-and-cut' schemes ⋮ A capacity allocation problem with integer side constraints

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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