356 search results - page 4 / 72 » On the Global Solution of Linear Programs with Linear Comple... |
CP
2000
Springer
14 years 1 months ago
2000
Springer
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...
PARA
1995
Springer
14 years 5 days ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
DAC
2007
ACM
14 years 9 months ago
2007
ACM
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
ICAL
2011
12 years 8 months ago
2011
— 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...