Sciweavers

431 search results - page 6 / 87
» 4OR: Year 4
Sort
View
4OR
2006
100views more  4OR 2006»
13 years 7 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
4OR
2005
104views more  4OR 2005»
13 years 7 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
4OR
2005
158views more  4OR 2005»
13 years 7 months ago
Bilevel programming: A survey
This paper provides an introductory survey of a class of optimization problems known as bilevel programming. We motivate this class through a simple application, and then proceed w...
Benoît Colson, Patrice Marcotte, Gilles Sava...
4OR
2004
99views more  4OR 2004»
13 years 7 months ago
Upper bounds for revenue maximization in a satellite scheduling problem
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...
Thierry Benoist, Benoît Rottembourg
4OR
2004
57views more  4OR 2004»
13 years 7 months ago
The generation of stable project plans
This text summarises the PhD thesis that Roel Leus presented to obtain the degree of Doctor in Applied Economics at the Katholieke Universiteit Leuven, in September 2003. The promo...
Roel Leus