Branch-cut-price algorithms for solving a class of search problems on general graphs.
- Published in:
- Networks, 2017, v. 70, n. 1, p. 4, doi. 10.1002/net.21740
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2017 AND VI 70 AND IP 1
Results: 7
1
2
An inexact sample average approximation approach for the stochastic connected facility location problem.
- Published in:
- Networks, 2017, v. 70, n. 1, p. 19, doi. 10.1002/net.21743
- By:
- Publication type:
- Article
3
The vehicle routing problem with drones: Extended models and connections.
- Published in:
- Networks, 2017, v. 70, n. 1, p. 34, doi. 10.1002/net.21746
- By:
- Publication type:
- Article
4
Adaptive large neighborhood search algorithm for the rural postman problem with time windows.
- Published in:
- Networks, 2017, v. 70, n. 1, p. 44, doi. 10.1002/net.21747
- By:
- Publication type:
- Article
5
Minimizing the makespan in multiserver network restoration problems.
- Published in:
- Networks, 2017, v. 70, n. 1, p. 60, doi. 10.1002/net.21750
- By:
- Publication type:
- Article
6
Editorial.
- Published in:
- 2017
- By:
- Publication type:
- Editorial
7
Issue Information.
- Published in:
- Networks, 2017, v. 70, n. 1, p. 1, doi. 10.1002/net.21706
- Publication type:
- Article