A heuristic for multiple choice programming
From MaRDI portal
Recommendations
- 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
Cites work
- 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?)
- 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 Improved Implicit Enumeration Approach for Integer Programming
- An ideal column algorithm for integer programs with special ordered sets of variables
- Branch and Bound Methods for Multi-Item Scheduling
- Convexity cuts for multiple choice problems
- Generalized upper bounding techniques
- Heuristics and their design: A survey
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Integer Programming Models for Sales Resource Allocation
- Integer Programming by Implicit Enumeration and Balas’ Method
- 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
Cited in
(9)- A note on the pivot and complement heuristic for 0-1 programming problems
- Computational comparison on the partitioning strategies in multiple choice integer programming
- Choice by iterative search
- Heuristic methods and applications: A categorized survey
- Multiple choice programming: A state-of-the-art review
- On the calculation of true and pseudo penalties in multiple choice integer programming
- Scheduling experiments on a nulear reactor using mixed integer programming
- scientific article; zbMATH DE number 794382 (Why is no real title available?)
- scientific article; zbMATH DE number 4189487 (Why is no real title available?)
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)
