A heuristic for multiple choice programming
- 31 December 1985
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 12 (1) , 25-37
- https://doi.org/10.1016/0305-0548(85)90004-8
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Heuristics and their design: a surveyEuropean Journal of Operational Research, 1981
- The design and analysis of heuristicsNetworks, 1981
- Reporting computational experiments in mathematical programmingMathematical Programming, 1978
- A mathematical programming system for preference and compatibility maximized menu planning and schedulingMathematical Programming, 1978
- Convexity cuts for multiple choice problemsDiscrete Mathematics, 1973
- A Mathematical Programming Model for Scheduling Nursing Personnel in a HospitalManagement Science, 1972
- A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge ProblemsManagement Science, 1969
- An Improved Implicit Enumeration Approach for Integer ProgrammingOperations Research, 1969
- Generalized upper bounding techniquesJournal of Computer and System Sciences, 1967
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967