Hypercylindrically Deduced Cuts in Zero-One Integer Programs
From MaRDI portal
Publication:5641010
DOI10.1287/opre.19.6.1393zbMath0232.90041OpenAlexW2073499070MaRDI QIDQ5641010
No author found.
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
Related Items
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, General purpose heuristics for integer programming. I, Convexity cuts for multiple choice problems, Cut search methods in integer programming, Classical cuts for mixed-integer programming and branch-and-cut, Quasi-concave minimization subject to linear constraints, Improved convexity cuts for lattice point problems, Polyhedral annexation in mixed integer and combinatorial programming, Large-scale 0-1 linear programming on distributed workstations, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, Representability of functions, Cutting-planes for programs with disjunctive constraints, Polyhedral convexity cuts and negative edge extensions
