Generating cuts in integer programming with families of special ordered sets

DOI10.1016/0377-2217(90)90302-RzbMath0709.90083OpenAlexW1966710203MaRDI QIDQ922293

John M. Wilson

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90302-r

zbMATH Keywords

branch-and-boundcuts

Mathematics Subject Classification ID

Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Logic cuts for multilevel generalized assignment problems. ⋮ Mixed logical-linear programming ⋮ Efficient reformulation for 0-1 programs -- methods and computational results ⋮ \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates ⋮ Formulating logical implications in combinatorial optimisation

Uses Software

• SCICONIC
• MINOS

Cites Work

• Unnamed Item
• Implementations of special ordered sets in MP software
• S3 sets. An extension of the Beale-Tomlin special ordered sets
• Linear Programming with Special Ordered Sets
• Experimental Results on the New Techniques for Integer Programming Formulations
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation