Computational comparison on the partitioning strategies in multiple choice integer programming

DOI10.1016/0377-2217(94)00161-8zbMath0913.90220OpenAlexW1996382026MaRDI QIDQ1266577

Dennis L. Bricker, Edward Yu-Hsien Lin

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00161-8

zbMATH Keywords

branch-and-boundspecial ordered setmultiple choice integer programmingreformulation-and-transformation-techniqueweighted-mean-method

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Related Items (1)

Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming

Uses Software

• APL2

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for solving the multiple-choice knapsack problem
• A dynamic programming algorithm for multiple-choice constraints
• A heuristic for multiple choice programming
• A note on the knapsack problem with special ordered sets
• On the calculation of true and pseudo penalties in multiple choice integer programming
• Generalized upper bounding techniques
• 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
• Branch and Bound Methods for Multi-Item Scheduling
• The knapsack problem with disjoint multiple-choice constraints
• A branch and bound algorithm for the generalized assignment problem
• Improved penalty calculations for a mixed integer branch-and-bound algorithm
• Global optimization using special ordered sets
• Modeling Facility Location Problems as Generalized Assignment Problems
• Reporting computational experiments in mathematical programming
• An Algorithm for the Traveling Salesman 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: Computational comparison on the partitioning strategies in multiple choice integer programming