On the calculation of true and pseudo penalties in multiple choice integer programming
From MaRDI portal
Publication:1183620
DOI10.1016/0377-2217(91)90227-MzbMath0748.90044OpenAlexW2086264854MaRDI QIDQ1183620
Dennis L. Bricker, Edward Yu-Hsien Lin
Publication date: 28 June 1992
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(91)90227-m
Integer programming (90C10) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (4)
Incremental and encoding formulations for mixed integer programming ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Computational comparison on the partitioning strategies in multiple choice integer programming ⋮ Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic for multiple choice programming
- Generalized upper bounding techniques
- Linear Programming with Special Ordered Sets
- School Timetabling—A Case in Large Binary Integer Linear Programming
- Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
- An ideal column algorithm for integer programs with special ordered sets of variables
- Integer Programming Models for Sales Resource Allocation
- The bounded interval generalized assignment model
- Branch and Bound Methods for Multi-Item Scheduling
- Improved penalty calculations for a mixed integer branch-and-bound algorithm
- The Multiple-Choice Knapsack Problem
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
This page was built for publication: On the calculation of true and pseudo penalties in multiple choice integer programming
