A heuristic for multiple choice programming
A linear programming-based heuristic procedure for solving Multiple Choice Programming (MCP) problems is presented. Two pivot schemes which may be viewed as the specialized versions of those in Pivot and Complement, an efficient heuristic by \textit{E. Balas} and \textit{C. H. Martin} [Manage. Sci. 26, 86-96 (1980; Zbl 0442.90060)] for pure 0-1 programming, are incorporated into the procedure along with the additional features of cut generation, variable fixing and exchange operation. Three types of MCP problems were tested to evaluate the performance of our procedure. The computational results with seventy five test problems indicate that our heuristic is superior to the default option of APEX-III, which dictates to end the search for better solutions if one within ten per cent of optimum has been found, in both its computational efficiency and the quality of the solution obtained.
- scientific article; zbMATH DE number 794382
- scientific article; zbMATH DE number 4189487
- Multiple choice programming: A state-of-the-art review
- A dynamic programming algorithm for multiple-choice constraints
- Multi-choice programming: an overview of theories and applications
- A heuristic for Boolean optimization problems
- scientific article; zbMATH DE number 168209
- scientific article; zbMATH DE number 1203311
- scientific article; zbMATH DE number 4155780
- A bi-level multi-choice programming problem
- A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems
- A Chance Constrained Multiple Choice Programming Algorithm
- A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital
- A mathematical programming system for preference and compatibility maximized menu planning and scheduling
- An Efficient Algorithm for Multi-Item Scheduling
- An ideal column algorithm for integer programs with special ordered sets of variables
- An Improved Implicit Enumeration Approach for Integer Programming
- Branch and Bound Methods for Multi-Item Scheduling
- Convexity cuts for multiple choice problems
- Generalized upper bounding techniques
- Heuristics and their design: A survey
- scientific article; zbMATH DE number 3554017 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3410784 (Why is no real title available?)
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Integer Programming by Implicit Enumeration and Balas’ Method
- Integer Programming Models for Sales Resource Allocation
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
- Pivot and Complement–A Heuristic for 0-1 Programming
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Reporting computational experiments in mathematical programming
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- A note on the pivot and complement heuristic for 0-1 programming problems
- On the calculation of true and pseudo penalties in multiple choice integer programming
- Computational comparison on the partitioning strategies in multiple choice integer programming
- Heuristic methods and applications: A categorized survey
- Choice by iterative search
- scientific article; zbMATH DE number 794382 (Why is no real title available?)
- Multiple choice programming: A state-of-the-art review
- scientific article; zbMATH DE number 4189487 (Why is no real title available?)
- Scheduling experiments on a nulear reactor using mixed integer programming
This page was built for publication: A heuristic for multiple choice programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089261)
