Implementations of special ordered sets in MP software
DOI10.1016/0377-2217(84)90002-XzbMATH Open0537.90083OpenAlexW2091310599WikidataQ111935172 ScholiaQ111935172MaRDI QIDQ792884FDOQ792884
Authors: 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
Recommendations
- A note on modeling multiple choice requirements for simple mixed integer programming solvers
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- An application of special ordered sets to a periodic milk collection problem
- Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
surveyglobal optimizationnonconvex optimizationbranch and boundpiecewise linear functionsseparable programmingMP softwaremultiple choice restrictionsSpecial ordered sets
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Boolean programming (90C09)
Cites Work
- The Simplex Method for Quadratic Programming
- Title not available (Why is that?)
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- A tree-search algorithm for mixed integer programming problems
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Global optimization using special ordered sets
- Generalized upper bounding techniques
- Branch and Bound Methods for Mathematical Programming Systems
- Integer Programming Models for Sales Resource Allocation
- Computer Codes for Problems of Integer Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Experiments in mixed-integer linear programming using pseudo-costs
- An ideal column algorithm for integer programs with special ordered sets of variables
- An Allocation Model for Catalog Space Planning
- Title not available (Why is that?)
Cited In (9)
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
- Formulation of a problem involving assembly lines with multiple manning of work stations
- A note on modeling multiple choice requirements for simple mixed integer programming solvers
- Hierarchical benders decomposition for open-pit mine block sequencing
- Generating cuts in integer programming with families of special ordered sets
- Formulation of multiple-choice situations in linear programming models using binary coding matrices
- Branch-and-cut for linear programs with overlapping SOS1 constraints
This page was built for publication: Implementations of special ordered sets in MP software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792884)
