A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints.
- Published in:
- Networks, 2015, v. 65, n. 2, p. 139, doi. 10.1002/net.21588
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2015 AND VI 65 AND IP 2
Results: 7
1
2
Optimal vehicle routing with lower and upper bounds on route durations.
- Published in:
- Networks, 2015, v. 65, n. 2, p. 166, doi. 10.1002/net.21592
- By:
- Publication type:
- Article
3
Guest editorial: Recent trends in vehicle routing.
- Published in:
- 2015
- By:
- Publication type:
- Editorial
4
Waste collection routing-limited multiple landfills and heterogeneous fleet.
- Published in:
- Networks, 2015, v. 65, n. 2, p. 155, doi. 10.1002/net.21597
- By:
- Publication type:
- Article
5
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances.
- Published in:
- Networks, 2015, v. 65, n. 2, p. 129, doi. 10.1002/net.21586
- By:
- Publication type:
- Article
6
Timing problems and algorithms: Time decisions for sequences of activities.
- Published in:
- Networks, 2015, v. 65, n. 2, p. 102, doi. 10.1002/net.21587
- By:
- Publication type:
- Article
7
The school bus routing and scheduling problem with transfers.
- Published in:
- Networks, 2015, v. 65, n. 2, p. 180, doi. 10.1002/net.21589
- By:
- Publication type:
- Article