Results 301 to 310 of about 2,078,237 (349)

On the complexity of cutting-plane proofs using split cuts

Operations Research Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Fenchel Cutting Planes for Integer Programs

Operations Research, 1994
A technique for generating cutting planes for integer programs is introduced that is based on the ability to optimize a linear function on a polyhedron rather than explicit knowledge of the underlying polyhedral structure of the integer program. The theoretical properties of the cuts and their relationship to Lagrangian relaxation are discussed, the ...
openaire   +2 more sources

Finding the Right Cutting Planes for the TSP

ACM Journal of Experimental Algorithmics, 1999
Given 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

Cutting Plane Methods

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

A cutting plane algorithm for the site layout planning problem with travel barriers

Computers & Operations Research, 2017
A. Hammad, D. Rey, A. Akbarnezhad
semanticscholar   +1 more source

Cutting Plane Algorithm for Convex Generalized Disjunctive Programs

INFORMS journal on computing, 2016
Francisco Trespalacios, I. Grossmann
semanticscholar   +1 more source

Fully decentralised multi-area dynamic economic dispatch for large-scale power systems via cutting plane consensus

, 2016
Wenmeng Zhao, Mingbo Liu, Jianquan Zhu, Licheng Li   +3 more
semanticscholar   +1 more source

The Cutting-Plane Method for Solving Convex Programs

, 1960
J. E. Kelley
semanticscholar   +1 more source

A new cut-and-solve and cutting plane combined approach for the capacitated lane reservation problem

Computers & industrial engineering, 2015
Yunfei Fang, F. Chu, S. Mammar, Qin Shi
semanticscholar   +1 more source

A cutting plane method for bilevel linear programming with interval coefficients

Annals of Operations Research, 2014
Aihong Ren, Yuping Wang
semanticscholar   +1 more source