Sciweavers

48 search results - page 6 / 10
» disopt 2008
Sort
View
DISOPT
2008
74views more  DISOPT 2008»
13 years 8 months ago
George B. Dantzig and systems optimization
We pay homage to George B. Dantzig by describing a less well known part of his legacy--his early and dedicated championship of the importance of systems optimization in solving co...
Philip E. Gill, Walter Murray, Michael A. Saunders...
DISOPT
2007
114views more  DISOPT 2007»
13 years 8 months ago
Bounds for online bounded space hypercube packing
In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed withi...
Leah Epstein, Rob van Stee
DISOPT
2006
110views more  DISOPT 2006»
13 years 8 months ago
New facets of the STS polytope generated from known facets of the ATS polytope
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
Egon Balas, Robert Carr, Matteo Fischetti, Neil Si...
DISOPT
2007
109views more  DISOPT 2007»
13 years 8 months ago
Sequential pairing of mixed integer inequalities
We present a scheme for generating new valid inequalities for mixed integer programs by taking pairwise combinations of existing valid inequalities. Our scheme is related to mixed...
Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
DISOPT
2007
93views more  DISOPT 2007»
13 years 8 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...