Sciweavers

1064 search results - page 1 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
INFORMS
2010
147views more  INFORMS 2010»
13 years 27 days ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
13 years 10 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
14 years 16 days ago
Fast and robust quadratic placement combined with an exact linear net model
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
Peter Spindler, Frank M. Johannes
MP
2010
163views more  MP 2010»
12 years 10 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
SDM
2010
SIAM
165views Data Mining» more  SDM 2010»
13 years 5 months ago
Exact Passive-Aggressive Algorithm for Multiclass Classification Using Support Class
The Passive Aggressive framework [1] is a principled approach to online linear classification that advocates minimal weight updates i.e., the least required so that the current tr...
Shin Matsushima, Nobuyuki Shimizu, Kazuhiro Yoshid...