Sciweavers

55 search results - page 5 / 11
» orl 2008
Sort
View
ORL
2008
115views more  ORL 2008»
14 years 11 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama
ORL
2008
120views more  ORL 2008»
14 years 11 months ago
Composition of stable set polyhedra
Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph...
Benjamin McClosky, Illya V. Hicks
ORL
2008
82views more  ORL 2008»
14 years 11 months ago
On test sets for nonlinear integer maximization
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
Jon Lee, Shmuel Onn, Robert Weismantel
ORL
2008
101views more  ORL 2008»
14 years 11 months ago
Gear composition and the stable set polytope
We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields cou...
Anna Galluccio, Claudio Gentile, Paolo Ventura
ORL
2008
72views more  ORL 2008»
14 years 11 months ago
Stochastic 0-1 linear programming under limited distributional information
We consider the problem minX{0,1}n {c x : aj x bj , j = 1, . . . , m}, where the aj are random vectors with unknown distributions. The only information we are given regarding the ...
Michael R. Wagner