400 search results - page 9 / 80 » Extended formulations in combinatorial optimization |
EOR
2008
14 years 9 months ago
2008
In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatoria...
IWCM
2004
Springer
15 years 2 months ago
2004
Springer
Estimation of optical flow and physically motivated brightness changes can be formulated as parameter estimation in linear models. Accuracy of this estimation heavily depends on t...
105
click to vote
JCO
2011
14 years 12 days ago
2011
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
66
Voted
STOC
1999
ACM
15 years 1 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
134
click to vote
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...