Works matching IS 00283045 AND DT 2007 AND VI 49 AND IP 4
Results: 8
Models and branch-and-cut algorithms for pickup and delivery problems with time windows.
- Published in:
- Networks, 2007, v. 49, n. 4, p. 258, doi. 10.1002/net.20177
- By:
- Publication type:
- Article
A branch & cut algorithm for the windy general routing problem and special cases.
- Published in:
- Networks, 2007, v. 49, n. 4, p. 245, doi. 10.1002/net.20176
- By:
- Publication type:
- Article
A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems.
- Published in:
- Networks, 2007, v. 49, n. 4, p. 330, doi. 10.1002/net.20182
- By:
- Publication type:
- Article
Route 2005: Recent advances in vehicle routing optimization.
- Published in:
- Networks, 2007, v. 49, n. 4, p. 243, doi. 10.1002/net.20175
- By:
- Publication type:
- Article
Metaheuristics for the vehicle routing problem with loading constraints.
- Published in:
- Networks, 2007, v. 49, n. 4, p. 294, doi. 10.1002/net.20179
- By:
- Publication type:
- Article
The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results.
- Published in:
- Networks, 2007, v. 49, n. 4, p. 318, doi. 10.1002/net.20181
- By:
- Publication type:
- Article
Path inequalities for the vehicle routing problem with time windows.
- Published in:
- Networks, 2007, v. 49, n. 4, p. 273, doi. 10.1002/net.20178
- By:
- Publication type:
- Article
Competitive analysis for dynamic multiperiod uncapacitated routing problems.
- Published in:
- Networks, 2007, v. 49, n. 4, p. 308, doi. 10.1002/net.20180
- By:
- Publication type:
- Article