A heuristic for multiple choice programming
From MaRDI portal
Publication:1089261
DOI10.1016/0305-0548(85)90004-8zbMATH Open0618.90070OpenAlexW2024556165MaRDI QIDQ1089261FDOQ1089261
Authors: Suk-Gwon Chang, Dong-wan Tcha 
Publication date: 1985
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(85)90004-8
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
Numerical mathematical programming methods (65K05) Linear programming (90C05) Mixed integer programming (90C11) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Reporting computational experiments in mathematical programming
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
- An Improved Implicit Enumeration Approach for Integer Programming
- A Mathematical Programming Model for Scheduling Nursing Personnel in a Hospital
- An Efficient Algorithm for Multi-Item Scheduling
- Generalized upper bounding techniques
- Integer Programming Models for Sales Resource Allocation
- Title not available (Why is that?)
- Pivot and Complement–A Heuristic for 0-1 Programming
- Integer Programming by Implicit Enumeration and Balas’ Method
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- A mathematical programming system for preference and compatibility maximized menu planning and scheduling
- Heuristics and their design: A survey
- An ideal column algorithm for integer programs with special ordered sets of variables
- Branch and Bound Methods for Multi-Item Scheduling
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Convexity cuts for multiple choice problems
- A Chance Constrained Multiple Choice Programming Algorithm
- Title not available (Why is that?)
- A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems
Cited In (9)
- A note on the pivot and complement heuristic for 0-1 programming problems
- Choice by iterative search
- Computational comparison on the partitioning strategies in multiple choice integer programming
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
