Results 261 to 270 of about 1,171,807 (293)
Some of the next articles are maybe not open access.
Cutting-Planes for Complementarity Constraints
SIAM Journal on Control and Optimization, 1978A characterization is given of all the cutting-planes for a generalized linear complementarity problem, in terms of rules whose repeated application yields exactly these valid implied inequalities.This report is a revision of our paper (1976), and our earlier proofs have been substantially simplified.
openaire +1 more source
On the complexity of cutting-plane proofs using split cuts
Operations Research Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Fenchel Cutting Planes for Integer Programs
Operations Research, 1994A 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 +3 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 +2 more sources
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
2014
Subgradient methods described in the previous chapter use only one arbitrary subgradient (generalized gradient) at a time, without memory of past iterations. If the information from previous iterations is kept, it is possible to define a model—the so-called cutting plane model—of the objective function.
Adil Bagirov +2 more
openaire +1 more source
Subgradient methods described in the previous chapter use only one arbitrary subgradient (generalized gradient) at a time, without memory of past iterations. If the information from previous iterations is kept, it is possible to define a model—the so-called cutting plane model—of the objective function.
Adil Bagirov +2 more
openaire +1 more source
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
INFORMS Journal on Computing, 2022Riley Badenbroek, Etienne de Klerk
exaly
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
INFORMS Journal on Computing, 1998Geir Dahl
exaly
An extended cutting plane method for solving convex MINLP problems
Computers and Chemical Engineering, 1995Frank Pettersson, Tapio Westerlund
exaly