A facet generation and relaxation technique applied to an assignment problem with side constraints
Open Access
- 1 February 1991
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 50 (3) , 335-344
- https://doi.org/10.1016/0377-2217(91)90265-w
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning ModelsOperations Research, 1985
- Using duality to solve discrete optimization problems: Theory and computational experiencePublished by Springer Nature ,1975
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955