Computational comparison on the partitioning strategies in multiple choice integer programming

DOI10.1016/0377-2217(94)00161-8MaRDI QIDQ1266577zbMATH OpenOpenAlexFDO

Authors Dennis 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-boundmultiple choice integer programmingreformulation-and-transformation-techniquespecial ordered setweighted-mean-method

Mathematics Subject Classification ID

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

Recommendations

• A heuristic for multiple choice programming
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• The reduced cost branch and bound algorithm for mixed integer programming
• On the calculation of true and pseudo penalties in multiple choice integer programming
• A minimal algorithm for the multiple-choice knapsack problem

Cites work

• A branch and bound algorithm for solving the multiple-choice knapsack problem
• A branch and bound algorithm for the generalized assignment 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
• An Algorithm for the Traveling Salesman Problem
• An ideal column algorithm for integer programs with special ordered sets of variables
• Branch and Bound Methods for Multi-Item Scheduling
• Generalized upper bounding techniques
• Global optimization using special ordered sets
• scientific article; zbMATH DE number 3526452 (Why is no real title available?)
• scientific article; zbMATH DE number 3331337 (Why is no real title available?)
• Improved penalty calculations for a mixed integer branch-and-bound algorithm
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Integer Programming Models for Sales Resource Allocation
• Investigation of some branch and bound strategies for the solution of mixed integer linear programs
• Modeling Facility Location Problems as Generalized Assignment Problems
• Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
• On the calculation of true and pseudo penalties in multiple choice integer programming
• Reporting computational experiments in mathematical programming
• School Timetabling—A Case in Large Binary Integer Linear Programming
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• The knapsack problem with disjoint multiple-choice constraints

Cited in

(3)

• Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• Computational performance evaluation of two integer linear programming models for the minimum common string partition problem

Describes a project that uses

Uses Software

• APL2

This page was built for publication: Computational comparison on the partitioning strategies in multiple choice integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266577)