Results 271 to 280 of about 23,957 (296)
Some of the next articles are maybe not open access.
On the complexity of cutting-plane proofs using split cuts
Operations Research Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Finding the Right Cutting Planes for the TSP
ACM Journal of Experimental Algorithmics, 1999Given an instance of the Traveling Salesman Problem (TSP), a reasonable way to get a lower bound on the optimal answer is to solve a linear programming relaxation of an integer programming formulation of the problem. These linear programs typically have an exponential number of constraints, but in theory they can be solved efficiently with the ...
openaire +1 more source
2000
In this chapter, we introduce a class of methods that were among the first to be designed for the solution of integer programming problems. Throughout the past decades, however, computational evidence has revealed that cutting planes, while appealing from a theoretical point of view, do not appear to work very well if applied to general integer ...
H. A. Eiselt, C.-L. Sandblom
openaire +1 more source
In this chapter, we introduce a class of methods that were among the first to be designed for the solution of integer programming problems. Throughout the past decades, however, computational evidence has revealed that cutting planes, while appealing from a theoretical point of view, do not appear to work very well if applied to general integer ...
H. A. Eiselt, C.-L. Sandblom
openaire +1 more source
2011
We now turn our attention to a proof system more powerful than resolution—the so-called cutting plane proof system. This proof system, which can be viewed as a “geometric generalization” of resolution, originated in works on integer programming by Gomory (1963) and Chvatal (1973); as a proof system it was first considered in Cook et al.
openaire +1 more source
We now turn our attention to a proof system more powerful than resolution—the so-called cutting plane proof system. This proof system, which can be viewed as a “geometric generalization” of resolution, originated in works on integer programming by Gomory (1963) and Chvatal (1973); as a proof system it was first considered in Cook et al.
openaire +1 more source
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II
Lecture Notes in Computer Science, 2021Marco Di Summa +2 more
exaly
Computational experience with general cutting planes for the Set Covering problem
Operations Research Letters, 2009Pasquale Avella +2 more
exaly
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
Mathematics of Operations Research, 2018Marco Molinaro, Santanu S Dey
exaly
On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming
SIAM Journal on Optimization, 1995E Andrew Boyd
exaly