90 search results - page 6 / 18 » Combinatorial Benders' Cuts |
HM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
IPCO
2008
13 years 9 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...
CP
2008
Springer
13 years 9 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
CPC
2006
13 years 7 months ago
2006
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...