Shortest paths avoiding forbidden subpaths.
- Published in:
- Networks, 2013, v. 61, n. 4, p. 322, doi. 10.1002/net.21490
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2013 AND VI 61 AND IP 4
Results: 5
1
2
Linearly many faults in arrangement graphs.
- Published in:
- Networks, 2013, v. 61, n. 4, p. 281, doi. 10.1002/net.21476
- By:
- Publication type:
- Article
3
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth.
- Published in:
- Networks, 2013, v. 61, n. 4, p. 335, doi. 10.1002/net.21487
- By:
- Publication type:
- Article
4
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route.
- Published in:
- Networks, 2013, v. 61, n. 4, p. 309, doi. 10.1002/net.21481
- By:
- Publication type:
- Article
5
Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems.
- Published in:
- Networks, 2013, v. 61, n. 4, p. 290, doi. 10.1002/net.21478
- By:
- Publication type:
- Article