400 search results - page 36 / 80 » Extended formulations in combinatorial optimization |
EOR
2007
14 years 11 months ago
2007
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
RECOMB
2008
Springer
16 years 2 days ago
2008
Springer
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...
EWSA
2006
Springer
15 years 3 months ago
2006
Springer
Assembling software components into an architecture is a difficult task because of its combinatorial complexity. There is thus a need for automating this building process, either t...
111
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
107
click to vote
CSL
2004
Springer
14 years 11 months ago
2004
Springer
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...