Found: 6
Select item for more details and to access through your institution.
Editorial: 2010 Glover-Klingman prize winners.
- Published in:
- Networks, 2012, v. 60, n. 4, p. 211, doi. 10.1002/net.21480
- By:
- Publication type:
- Article
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks.
- Published in:
- Networks, 2012, v. 60, n. 4, p. 212, doi. 10.1002/net.21459
- By:
- Publication type:
- Article
Simple linear flow decomposition algorithms on trees, circles, and augmented trees.
- Published in:
- Networks, 2012, v. 60, n. 4, p. 227, doi. 10.1002/net.21470
- By:
- Publication type:
- Article
Distributed tree comparison with nodes of limited memory.
- Published in:
- Networks, 2012, v. 60, n. 4, p. 235, doi. 10.1002/net.21463
- By:
- Publication type:
- Article
Approximating survivable networks with minimum number of steiner points.
- Published in:
- Networks, 2012, v. 60, n. 4, p. 245, doi. 10.1002/net.21466
- By:
- Publication type:
- Article
Min-Max quickest path problems.
- Published in:
- Networks, 2012, v. 60, n. 4, p. 253, doi. 10.1002/net.21473
- By:
- Publication type:
- Article