Anticipation versus reactive reoptimization for dynamic vehicle routing with stochastic requests.
- Published in:
- Networks, 2019, v. 73, n. 3, p. 277, doi. 10.1002/net.21861
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2019 AND VI 73 AND IP 3
Results: 7
1
2
Complexity of edge coloring with minimum reload/changeover costs.
- Published in:
- Networks, 2019, v. 73, n. 3, p. 344, doi. 10.1002/net.21867
- By:
- Publication type:
- Article
3
The most reliable flight itinerary problem.
- Published in:
- Networks, 2019, v. 73, n. 3, p. 325, doi. 10.1002/net.21866
- By:
- Publication type:
- Article
4
Minimum‐risk routing through a mapped minefield.
- Published in:
- Networks, 2019, v. 73, n. 3, p. 358, doi. 10.1002/net.21868
- By:
- Publication type:
- Article
5
Algorithmic results for potential‐based flows: Easy and hard cases.
- Published in:
- Networks, 2019, v. 73, n. 3, p. 306, doi. 10.1002/net.21865
- By:
- Publication type:
- Article
6
Inverse optimization in minimum cost flow problems on countably infinite networks.
- Published in:
- Networks, 2019, v. 73, n. 3, p. 292, doi. 10.1002/net.21862
- By:
- Publication type:
- Article
7
Issue Information.
- Published in:
- Networks, 2019, v. 73, n. 3, p. 275, doi. 10.1002/net.21839
- Publication type:
- Article