Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
684
Primal cutting plane algorithms revisited
- MATH METH OPER RES (2002) 56:67–81
, 2002
"... Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are wellknown and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms wer ..."
Abstract
-
Cited by 9 (2 self)
- Add to MetaCart
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are wellknown and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms
CUTTING PLANE ALGORITHMS FOR INTEGER PROGRAMMING
, 1998
"... Cutting plane methods are exact algorithms for integer programming problems. They have proven to be very useful computationally in the last few years, especially when combined with a branch and bound algorithm in a branch and cut framework. These methods work by solving a sequence of linear programm ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Cutting plane methods are exact algorithms for integer programming problems. They have proven to be very useful computationally in the last few years, especially when combined with a branch and bound algorithm in a branch and cut framework. These methods work by solving a sequence of linear
A cutting plane algorithm for the max-cut problem
- OPTIMIZATION METHODS AND SOFTWARE
, 1994
"... In this paper we describe a cutting plane algorithm to solve max-cut problems on complete graphs. We show that the separation problem over the cut polytope can be reduced to the separation problem over the cut cone and we give a separation algorithm for a class of inequality valid over the cut con ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
In this paper we describe a cutting plane algorithm to solve max-cut problems on complete graphs. We show that the separation problem over the cut polytope can be reduced to the separation problem over the cut cone and we give a separation algorithm for a class of inequality valid over the cut
Cutting Plane Algorithms for Semidefinite Relaxations
- TOPICS IN SEMIDEFINITE AND INTERIOR-POINT METHODS. FIELDS INSTITUTE COMMUNICATIONS SERIES VOL. 18, AMS
, 1997
"... We investigate the potential and limits of interior point based cutting ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
We investigate the potential and limits of interior point based cutting
A Primal Analogue of Cutting Plane Algorithms
, 1999
"... This paper deals with algorithmic issues related to the design of an augmentation algorithm for general integer programs. It is shown that every phase of a primal method has a natural analogue in cutting plane algorithms. In particular, the role that the Chv'atal-Gomory cuts play in cutting pla ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
This paper deals with algorithmic issues related to the design of an augmentation algorithm for general integer programs. It is shown that every phase of a primal method has a natural analogue in cutting plane algorithms. In particular, the role that the Chv'atal-Gomory cuts play in cutting
A CUTTING PLANE ALGORITHM FOR A CLUSTERING PROBLEM
, 1989
"... In this paper we consider a clustering problem that arises in qualitative data analysis. This problem can be transformed to a combinatorial optimization problem, the clique partitioning problem. We have studied the latter problem from a polyhedral point of view and determined large classes of facets ..."
Abstract
-
Cited by 54 (1 self)
- Add to MetaCart
of facets of the associated polytope. These theoretical results are utilized in this paper. We describe a cutting plane algorithm that is based on the simplex method and uses exact and heuristic separation routines for some of the classes of facets mentioned before. We discuss some details
A fast cutting-plane algorithm for optimal coalescing
- IN PROC. OF THE 16 TH INTERNATIONAL CONFERENCE ON COMPILER CONSTRUCTION (CC ’07
, 2007
"... Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorithm for the coalescing subproblem that relies on this separation. The algorithm uses 0/1 Linear Programming (ILP), a general-purpo ..."
Abstract
-
Cited by 16 (1 self)
- Add to MetaCart
Recent work has shown that the subtasks of register allocation (spilling, register assignment, and coalescing) can be completely separated. This work presents an algorithm for the coalescing subproblem that relies on this separation. The algorithm uses 0/1 Linear Programming (ILP), a general
Can pure cutting plane algorithms work?
"... We discuss an implementation of the lexicographic version of Gomory’s fractional cutting plane method and of two heuristics mimicking the latter. In computational testing on a battery of MIPLIB problems we compare the performance of these variants with that of the standard Gomory algorithm, both i ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
We discuss an implementation of the lexicographic version of Gomory’s fractional cutting plane method and of two heuristics mimicking the latter. In computational testing on a battery of MIPLIB problems we compare the performance of these variants with that of the standard Gomory algorithm, both
A Cutting Plane Algorithm for the Linear Arrangement Problem
, 2007
"... Given a graph G = (V, E) on n vertices, the Minimum Linear Arrangement Problem (MinLA) calls for a one-to-one function ψ: V → {1,..., n} which minimizes � {i,j}∈E |ψ(i) − ψ(j)|. MinLA is strongly N P-hard and very difficult to solve to optimality in practice. One of the reasons for this difficulty ..."
Abstract
- Add to MetaCart
is the lack of good lower bounds. In this paper, we take a polyhedral approach to MinLA. We associate an integer polyhedron with each graph G, and derive many classes of valid linear inequalities. It is shown that a cutting plane algorithm based on these inequalities can yield competitive lower bounds in a
A Cutting-Plane Algorithm for Minimum-Time Trajectory Planning of Industrial Robots
, 1997
"... The optimal minimum-time trajectory planning of an m-joint industrial robot is proposed by means of a newly devised outer cutting-plane algorithm. By using piece-wise cubic polynomials in the joint space, this algorithm provides a global solution to the minimum total time planning problem by adoptin ..."
Abstract
- Add to MetaCart
The optimal minimum-time trajectory planning of an m-joint industrial robot is proposed by means of a newly devised outer cutting-plane algorithm. By using piece-wise cubic polynomials in the joint space, this algorithm provides a global solution to the minimum total time planning problem
Results 1 - 10
of
684
