Cut search methods in integer programming
From MaRDI portal
Cites work
- An Intersection Cut from the Dual of the Unit Hypercube
- Convexity Cuts and Cut Search
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- Hypercylindrically Deduced Cuts in Zero-One Integer Programs
- Integer Programming and Pricing
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- The Generalized Lattice-Point Problem
Cited in
(8)- First facets of the octahedron
- Genetic algorithms and tabu search: Hybrids for optimization
- General purpose heuristics for integer programming. I
- Strong IP formulations need large coefficients
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- Characterization of facets for multiple right-hand choice linear programs
- Enumerative inequalities in integer programming
- Integer programming and convex analysis: Intersection cuts from outer polars
This page was built for publication: Cut search methods in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661707)
