Sciweavers

16091 search results - page 462 / 3219
» Solving
Sort
View
EOR
2007
90views more  EOR 2007»
15 years 6 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
EOR
2007
111views more  EOR 2007»
15 years 6 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville
EOR
2007
111views more  EOR 2007»
15 years 6 months ago
A pegging approach to the precedence-constrained knapsack problem
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
Byungjun You, Takeo Yamada
MP
2006
105views more  MP 2006»
15 years 6 months ago
Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach
We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value fun...
Nan Kong, Andrew J. Schaefer, Brady Hunsaker
NA
2006
75views more  NA 2006»
15 years 6 months ago
Least-squares spectral collocation with the overlapping Schwarz method for the incompressible Navier-Stokes equations
A least-squares spectral collocation scheme is combined with the overlapping Schwarz method. The methods are succesfully applied to the incompressible Navier-Stokes equations. The...
Wilhelm Heinrichs