1603 search results - page 123 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
221
click to vote
CPAIOR
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
198
click to vote
COR
2007
15 years 6 months ago
2007
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
207
click to vote
MP
2006
15 years 6 months ago
2006
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
201
click to vote
CCE
2005
15 years 6 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
138
click to vote
GECCO
2004
Springer
16 years 8 days ago
2004
Springer
Before Multiobjective EvolutionaryAlgorithms (MOEAs) can be used as a widespread tool for solving arbitrary real world problems there are some salient issues which require further ...