Generating cuts in integer programming with families of special ordered sets

DOI10.1016/0377-2217(90)90302-RzbMATH Open0709.90083OpenAlexW1966710203MaRDI QIDQ922293FDOQ922293

Authors: 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

Recommendations

• Cutting planes in integer and mixed integer programming
• Spherical cuts for integer programming problems
• Computational Integer Programming and Cutting Planes
• Cutting planes for integer programs with general integer variables
• scientific article; zbMATH DE number 808805

zbMATH Keywords

branch-and-boundcuts

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• 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
• Mixed logical-linear programming
• Logic cuts for multilevel generalized assignment problems.

Uses Software

• SCICONIC
• MINOS

This page was built for publication: Generating cuts in integer programming with families of special ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922293)