3221 search results - page 184 / 645 » Termination of Linear Programs |
179
click to vote
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...
183
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...
166
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
162
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
176
click to vote
DISOPT
2007
15 years 6 months ago
2007
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary v...