415 search results - page 20 / 83 » An efficient approximation for the Generalized Assignment Pr... |
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
HM
2007
Springer
14 years 11 days ago
2007
Springer
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
WINE
2010
Springer
13 years 6 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...