Sciweavers

1064 search results - page 3 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
COCOA
2007
Springer
13 years 11 months ago
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
Lanbo Zheng, Christoph Buchheim
ICAL
2011
301views more  ICAL 2011»
12 years 5 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...
ICIP
2007
IEEE
14 years 7 months ago
Two-Step Algorithms for Linear Inverse Problems with Non-Quadratic Regularization
Iterative shrinkage/thresholding (IST) algorithms have been recently proposed to handle high-dimensional convex optimization problems arising in image inverse problems (namely dec...
José M. Bioucas-Dias, Mário A. T. Fi...
EOR
2010
113views more  EOR 2010»
13 years 5 months ago
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Marie-Christine Plateau, Yasmin A. Rios-Solis
COMPGEOM
2006
ACM
13 years 11 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...