Implementations of special ordered sets in MP software

DOI10.1016/0377-2217(84)90002-XzbMath0537.90083OpenAlexW2091310599WikidataQ111935172 ScholiaQ111935172MaRDI QIDQ792884

Wilhelm Hummeltenberg

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90002-x

zbMATH Keywords

surveyglobal optimizationbranch and boundnonconvex optimizationseparable programmingpiecewise linear functionsMP softwaremultiple choice restrictionsSpecial ordered sets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Boolean programming (90C09) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (6)

Formulation of a problem involving assembly lines with multiple manning of work stations ⋮ Branch-and-cut for linear programs with overlapping SOS1 constraints ⋮ Generating cuts in integer programming with families of special ordered sets ⋮ Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing ⋮ A note on modeling multiple choice requirements for simple mixed integer programming solvers ⋮ Formulation of multiple-choice situations in linear programming models using binary coding matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized upper bounding techniques
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• The Simplex Method for Quadratic Programming
• An ideal column algorithm for integer programs with special ordered sets of variables
• An Allocation Model for Catalog Space Planning
• Computer Codes for Problems of Integer Programming
• Integer Programming Models for Sales Resource Allocation
• Global optimization using special ordered sets
• Experiments in mixed-integer linear programming using pseudo-costs
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Branch and Bound Methods for Mathematical Programming Systems
• A tree-search algorithm for mixed integer programming problems
• Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)

This page was built for publication: Implementations of special ordered sets in MP software