Cut search methods in integer programming

DOI10.1007/BF01584977zbMath0247.90042MaRDI QIDQ5661707

Fred Glover

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Genetic algorithms and tabu search: Hybrids for optimization, General purpose heuristics for integer programming. I, Enumerative inequalities in integer programming, Integer programming and convex analysis: Intersection cuts from outer polars, First facets of the octahedron, Strong IP formulations need large coefficients, Characterization of facets for multiple right-hand choice linear programs, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs

Cites Work

• Unnamed Item
• Integer Programming and Pricing
• The Generalized Lattice-Point Problem
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• An Intersection Cut from the Dual of the Unit Hypercube
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• Convexity Cuts and Cut Search