Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
DISOPT
2008
87views more  DISOPT 2008»
11 years 3 days ago
A Branch and Price algorithm for the k-splittable maximum flow problem
Jérôme Truffot, Christophe Duhamel
DISOPT
2008
89views more  DISOPT 2008»
11 years 1 months ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
DISOPT
2008
99views more  DISOPT 2008»
11 years 1 months ago
Computing robust basestock levels
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust framework. We present a family of algorithms based on decom...
Daniel Bienstock, Nuri Özbay
DISOPT
2008
89views more  DISOPT 2008»
11 years 1 months ago
Complexity of the min-max (regret) versions of min cut problems
This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
DISOPT
2008
107views more  DISOPT 2008»
11 years 1 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
DISOPT
2008
89views more  DISOPT 2008»
11 years 1 months ago
A pricing problem under Monge property
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
Oktay Günlük
DISOPT
2008
93views more  DISOPT 2008»
11 years 1 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
DISOPT
2008
74views more  DISOPT 2008»
11 years 1 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
2008
55views more  DISOPT 2008»
11 years 1 months ago
A sequential elimination algorithm for computing bounds on the clique number of a graph
Bernard Gendron, Alain Hertz, Patrick St-Louis
books