Sciweavers

2636 search results - page 93 / 528
» Linear Programming
Sort
View
COCOA
2008
Springer
14 years 11 months ago
Automatic Generation of Symmetry-Breaking Constraints
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...
Leo Liberti
APPROX
2010
Springer
189views Algorithms» more  APPROX 2010»
14 years 10 months ago
Approximating Sparsest Cut in Graphs of Bounded Treewidth
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...
Eden Chlamtac, Robert Krauthgamer, Prasad Raghaven...
CORR
2007
Springer
76views Education» more  CORR 2007»
14 years 10 months ago
Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
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...
Roman Vershynin
DISOPT
2007
96views more  DISOPT 2007»
14 years 10 months ago
Symmetric ILP: Coloring and small integers
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...
François Margot
ORL
2008
91views more  ORL 2008»
14 years 10 months ago
On the integrality ratio for tree augmentation
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...
Joseph Cheriyan, Howard J. Karloff, Rohit Khandeka...