Sciweavers

9 search results - page 1 / 2
» The Wiener maximum quadratic assignment problem
Sort
View
DISOPT
2011
201views Education» more  DISOPT 2011»
13 years 2 months ago
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
Eranda Çela, Nina S. Schmuck, Shmuel Wimer,...
MP
2010
163views more  MP 2010»
13 years 5 months ago
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
Christoph Buchheim, Frauke Liers, Marcus Oswald
CPAIOR
2010
Springer
14 years 3 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
ICCV
2011
IEEE
12 years 11 months ago
Generalized Roof Duality for Pseudo-Boolean Optimization
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
Fredrik Kahl, Petter Strandmark