400 search results - page 34 / 80 » Extended formulations in combinatorial optimization |
114
click to vote
ICN
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...
NHM
2010
14 years 6 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
112
click to vote
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
100
click to vote
ICRA
2010
IEEE
14 years 9 months ago
2010
IEEE
We present an approach for efficiently recognizing all objects in a scene and estimating their full pose from multiple views. Our approach builds upon a state of the art single-vie...
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...