Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane.
- Published in:
- Networks, 2019, v. 73, n. 1, p. 89, doi. 10.1002/net.21835
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2019 AND VI 73 AND IP 1
Results: 9
1
2
A note on "A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs".
- Published in:
- Networks, 2019, v. 73, n. 1, p. 135, doi. 10.1002/net.21849
- By:
- Publication type:
- Article
3
A computation‐implementation parallelization approach to the vehicle loading and routing problem.
- Published in:
- Networks, 2019, v. 73, n. 1, p. 119, doi. 10.1002/net.21848
- By:
- Publication type:
- Article
4
Cost allocation mechanisms in a peer‐to‐peer network.
- Published in:
- Networks, 2019, v. 73, n. 1, p. 104, doi. 10.1002/net.21845
- By:
- Publication type:
- Article
5
Issue Information.
- Published in:
- Networks, 2019, v. 73, n. 1, p. 1, doi. 10.1002/net.21837
- Publication type:
- Article
6
Detecting critical node structures on graphs: A mathematical programming approach.
- Published in:
- Networks, 2019, v. 73, n. 1, p. 48, doi. 10.1002/net.21834
- By:
- Publication type:
- Article
7
A note on the rainbow cycle cover problem.
- Published in:
- Networks, 2019, v. 73, n. 1, p. 38, doi. 10.1002/net.21833
- By:
- Publication type:
- Article
8
Stochastic network interdiction with incomplete preference.
- Published in:
- Networks, 2019, v. 73, n. 1, p. 3, doi. 10.1002/net.21831
- By:
- Publication type:
- Article
9
A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths.
- Published in:
- Networks, 2019, v. 73, n. 1, p. 23, doi. 10.1002/net.21832
- By:
- Publication type:
- Article