Hypercylindrically Deduced Cuts in Zero-One Integer Programs

DOI10.1287/OPRE.19.6.1393MaRDI QIDQ5641010zbMATH OpenOpenAlexFDO

Authors

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.19.6.1393

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cited in

(15)

• A branch and bound algorithm for extreme point mathematical programming problems
• Representability in mixed integer programming. I: Characterization results
• A simplification for some disjunctive formulations
• Quasi-concave minimization subject to linear constraints
• Improved convexity cuts for lattice point problems
• General purpose heuristics for integer programming. I
• Convexity cuts for multiple choice problems
• Representability of functions
• On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
• Cutting-planes for programs with disjunctive constraints
• Polyhedral annexation in mixed integer and combinatorial programming
• Polyhedral convexity cuts and negative edge extensions
• Cut search methods in integer programming
• Classical cuts for mixed-integer programming and branch-and-cut
• Large-scale 0-1 linear programming on distributed workstations

This page was built for publication: Hypercylindrically Deduced Cuts in Zero-One Integer Programs

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