Local cuts for mixed-integer programming
TL;DR: This work extends the procedure for cutting-plane generation to general mixed-integer programming problems, obtaining a range of possibilities for new sources of cutting planes, both in floating-point arithmetic and in rational arithmetic.
read more
Abstract: A general framework for cutting-plane generation was proposed by Applegate et al. in the context of the traveling salesman problem. The process considers the image of a problem space under a linear mapping, chosen so that a relaxation of the mapped problem can be solved efficiently. Optimization in the mapped space can be used to find a separating hyperplane, if one exists, and via substitution this gives a cutting plane in the original space. We extend this procedure to general mixed-integer programming problems, obtaining a range of possibilities for new sources of cutting planes. Some of these possibilities are explored computationally, both in floating-point arithmetic and in rational arithmetic.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Chance-Constrained Binary Packing Problems
TL;DR: This work considers a class of packing problems with uncertain data, which it refers to as the chance-constrained binary packing problem, and proposes a problem formulation in its original space based on the so-called probabilistic covers.
111
Operations Research Letters
Jan Karel Lenstra,Gerhard J. Woeginger,F Spieksma,P Marcotte,S Kou,N Megiddo,B Shepherd,S Seshadri,R Schultz,T de Kok,C Helmberg,A Martin,S van de Velde,S Andradottir,S C Borst,T Takine,George L. Nemhauser,K Aardal,D Klatte +18 more
- 01 Jan 2011
TL;DR: Operations Research Letters is a publication for literature on all aspects of operations research and the management and decision sciences that focuses on new models, theorems, algorithms, and experimental work that the author wants to disseminate rapidly.
108
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
TL;DR: In this paper, the authors proposed a methodology that can approximate the convex hulls of all possible capacitated relaxations by generating violated valid inequalities, which can be used efficiently in a regular branch-and-bound procedure.
Embedding Formulations and Complexity for Unions of Polyhedra
TL;DR: Embedding formulations and complexity is introduced as a new MIP formulation paradigm for systematically constructing formulations for disjunctive constraints that are optimal with respect to size.
Lifting, tilting and fractional programming revisited
TL;DR: This work introduces a simple common framework for lifting, tilting and fractional programming, and extends known results from each to the other two, and revisits key properties of these three problems on mixed integer linear sets.
23
References
•Book
Geometric Algorithms and Combinatorial Optimization
Martin Grötschel,László Lovász,Alexander Schrijver +2 more
- 01 Jan 1988
TL;DR: In this article, the Fulkerson Prize was won by the Mathematical Programming Society and the American Mathematical Society for proving polynomial time solvability of problems in convexity theory, geometry, and combinatorial optimization.
3.9K
•Book
The Traveling Salesman Problem: A Computational Study
David Applegate,Robert E. Bixby,Vašek Chvátal,William J. Cook +3 more
- 04 Feb 2007
TL;DR: Open Library features a library with books from the Internet Archive and lists them in the open library and gives you access to over 1 million free e-Books and the ability to search using subject, title and author.
2.2K
Integer Programming with a Fixed Number of Variables
TL;DR: It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable.
SCIP: solving constraint integer programs
TL;DR: An overview of the main design concepts of SCIP and how it can be used to solve constraint integer programs is given and experimental results show that the approach outperforms current state-of-the-art techniques for proving the validity of properties on circuits containing arithmetic.
A lift-and-project cutting plane algorithm for mixed 0-1 programs
TL;DR: A cutting plane algorithm for mixed 0–1 programs based on a family of polyhedra which strengthen the usual LP relaxation and shows how to generate a facet of a polyhedron in this family which is most violated by the current fractional point.