A note on detecting unbounded instances of the online shortest path problem.
- Published in:
- Networks, 2016, v. 67, n. 4, p. 270, doi. 10.1002/net.21670
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2016 AND VI 67 AND IP 4
Results: 9
1
2
Reformulation and decomposition approaches for traffic routing in optical networks.
- Published in:
- Networks, 2016, v. 67, n. 4, p. 277, doi. 10.1002/net.21672
- By:
- Publication type:
- Article
3
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems.
- Published in:
- Networks, 2016, v. 67, n. 4, p. 299, doi. 10.1002/net.21677
- By:
- Publication type:
- Article
4
Two node-disjoint hop-constrained survivable network design and polyhedra.
- Published in:
- Networks, 2016, v. 67, n. 4, p. 316, doi. 10.1002/net.21679
- By:
- Publication type:
- Article
5
Issue Information - Table of Contents.
- Published in:
- Networks, 2016, v. 67, n. 4, p. 263, doi. 10.1002/net.21642
- Publication type:
- Article
6
Issue Information - Aims and Scope.
- Published in:
- Networks, 2016, v. 67, n. 4, p. 264, doi. 10.1002/net.21643
- Publication type:
- Article
7
Algorithms and complexity results for finding graphs with extremal Randić index.
- Published in:
- Networks, 2016, v. 67, n. 4, p. 338, doi. 10.1002/net.21680
- By:
- Publication type:
- Article
8
Inflection points of reliability polynomials are dense in [0,1].
- Published in:
- Networks, 2016, v. 67, n. 4, p. 266, doi. 10.1002/net.21669
- By:
- Publication type:
- Article
9
Editorial: 2015 Glover-Klingman Prize Winners.
- Published in:
- 2016
- By:
- Publication type:
- Editorial