An ideal column algorithm for integer programs with special ordered sets of variables

DOI10.1007/BF02591892zbMath0517.90050MaRDI QIDQ3666590

Dennis J. Sweeney, R. Kipp Martin

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

branch and boundcomputational resultsheuristic algorithmlarge scale optimizationdistance measuresspecial ordered setLP-relaxationbranching procedureideal column

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (7)

The reduced cost branch and bound algorithm for mixed integer programming ⋮ A heuristic for multiple choice programming ⋮ On the calculation of true and pseudo penalties in multiple choice integer programming ⋮ Sequencing offshore oil and gas fields under uncertainty ⋮ Computational comparison on the partitioning strategies in multiple choice integer programming ⋮ A note on modeling multiple choice requirements for simple mixed integer programming solvers ⋮ Implementations of special ordered sets in MP software

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Allocation Model for Catalog Space Planning
• Bounds on the Effect of Aggregating Variables in Linear Programs
• Integer Programming Models for Sales Resource Allocation
• Branch and Bound Methods for Multi-Item Scheduling
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• On the Computational Complexity of Combinatorial Problems
• Global optimization using special ordered sets
• Experiments in mixed-integer linear programming using pseudo-costs
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• An Efficient Algorithm for Multi-Item Scheduling

This page was built for publication: An ideal column algorithm for integer programs with special ordered sets of variables