Implementations of special ordered sets in MP software
From MaRDI portal
Publication:792884
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)
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
Cites work
- scientific article; zbMATH DE number 3521444 (Why is no real title available?)
- scientific article; zbMATH DE number 3526452 (Why is no real title available?)
- scientific article; zbMATH DE number 3286662 (Why is no real title available?)
- scientific article; zbMATH DE number 3368489 (Why is no real title available?)
- A tree-search algorithm for mixed integer programming problems
- An Allocation Model for Catalog Space Planning
- An ideal column algorithm for integer programs with special ordered sets of variables
- Branch and Bound Methods for Mathematical Programming Systems
- Computer Codes for Problems of Integer Programming
- Experiments in mixed-integer linear programming using pseudo-costs
- Generalized upper bounding techniques
- Global optimization using special ordered sets
- Integer Programming Models for Sales Resource Allocation
- Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- The Simplex Method for Quadratic Programming
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
Cited in
(9)- Formulation of multiple-choice situations in linear programming models using binary coding matrices
- Formulation of a problem involving assembly lines with multiple manning of work stations
- Generating cuts in integer programming with families of special ordered sets
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- S3 sets. An extension of the Beale-Tomlin 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
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
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)
