154
click to vote
IPCO
15 years 3 months ago
2008 
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
129
Voted
IPCO
15 years 3 months ago
2008 
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...
126
click to vote
IPCO
15 years 3 months ago
2008 
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...
IPCO
15 years 3 months ago
2008  149
click to vote
IPCO
15 years 3 months ago
2008
Recent advances on the understanding of valid inequalities from the infinite group relaxation has opened the possibility of finding a computationally effective extension to GMI cu...
|
Optimization