Sciweavers

20 search results - page 4 / 4
» ipco 2008
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 6 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
IPCO
2008
105views Optimization» more  IPCO 2008»
13 years 6 months ago
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...
Arrigo Zanette, Matteo Fischetti, Egon Balas
IPCO
2008
188views Optimization» more  IPCO 2008»
13 years 6 months ago
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...
Adam N. Letchford, Michael M. Sørensen
IPCO
2008
163views Optimization» more  IPCO 2008»
13 years 6 months ago
The Air Traffic Flow Management Problem: An Integer Optimization Approach
In this paper, we present a new Integer Program (IP) for the Air Traffic Flow Management (ATFM) problem. The model we propose provides a complete representation of all the phases o...
Dimitris Bertsimas, Guglielmo Lulli, Amedeo R. Odo...
IPCO
2008
118views Optimization» more  IPCO 2008»
13 years 6 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...