1064 search results - page 8 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
ESA
2008
Springer
15 years 1 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
EOR
2008
14 years 11 months ago
2008
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
83
Voted
JEA
2008
14 years 11 months ago
2008
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
IJCAI
2003
15 years 1 months ago
2003
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...
ASPDAC
2008
ACM
15 years 1 months ago
2008
ACM
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-s...