Sciweavers

7 search results - page 1 / 2
» disopt 2011
Sort
View
DISOPT
2011
177views Education» more  DISOPT 2011»
12 years 11 months ago
Lower bounds on kernelization
Neeldhara Misra, Venkatesh Raman, Saket Saurabh
DISOPT
2011
176views Education» more  DISOPT 2011»
12 years 8 months ago
Valid inequalities and branch-and-cut for the clique pricing problem
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation net...
Géraldine Heilporn, Martine Labbé, P...
DISOPT
2011
201views Education» more  DISOPT 2011»
12 years 8 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,...
DISOPT
2011
210views Education» more  DISOPT 2011»
12 years 11 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider