Found: 8
Select item for more details and to access through your institution.
Packing cuts in undirected graphs.
- Published in:
- Networks, 2004, v. 44, n. 1, p. 1, doi. 10.1002/net.20008
- By:
- Publication type:
- Article
A stochastic integer programming approach to solving a synchronous optical network ring design problem.
- Published in:
- Networks, 2004, v. 44, n. 1, p. 12, doi. 10.1002/net.20009
- By:
- Publication type:
- Article
Some recent contributions to network optimization.
- Published in:
- Networks, 2004, v. 44, n. 1, p. 27, doi. 10.1002/net.20010
- By:
- Publication type:
- Article
Solving the asymmetric traveling salesman problem with periodic constraints.
- Published in:
- Networks, 2004, v. 44, n. 1, p. 31, doi. 10.1002/net.20011
- By:
- Publication type:
- Article
An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks.
- Published in:
- Networks, 2004, v. 44, n. 1, p. 38, doi. 10.1002/net.20012
- By:
- Publication type:
- Article
Algorithms for minimum-cost paths in time-dependent networks with waiting policies.
- Published in:
- Networks, 2004, v. 44, n. 1, p. 41, doi. 10.1002/net.20013
- By:
- Publication type:
- Article
Probabilistic location problems with discrete demand weights.
- Published in:
- Networks, 2004, v. 44, n. 1, p. 47, doi. 10.1002/net.20015
- By:
- Publication type:
- Article
2003 Glover-Klingman prize winners.
- Published in:
- Networks, 2004, v. 44, n. 1, p. iii, doi. 10.1002/net.20030
- By:
- Publication type:
- Article