Sciweavers

14548 search results - page 31 / 2910
» The Optimal Path-Matching Problem
Sort
View
MP
1998
109views more  MP 1998»
13 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
COR
2011
13 years 4 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria
AMAI
2010
Springer
13 years 7 months ago
Interval-valued soft constraint problems
Constraints and quantitative preferences, or costs, are very useful for modelling many real-life problems. However, in many settings, it is difficult to specify precise preference ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
DAM
2011
13 years 4 months ago
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
This paper considers a single-vehicle Dial-a-Ride problem in which customers may experience stochastic delays at their pickup locations. If a customer is absent when the vehicle s...
Géraldine Heilporn, Jean-François Co...
IJCV
2011
180views more  IJCV 2011»
13 years 4 months ago
Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
Egil Bae, Jing Yuan, Xue-Cheng Tai