Issue Information.
- Published in:
- Networks, 2020, v. 75, n. 2, p. 111, doi. 10.1002/net.21894
- Publication type:
- Article
Works matching IS 00283045 AND DT 2020 AND VI 75 AND IP 2
Results: 7
1
2
On the distance between random events on a network.
- Published in:
- Networks, 2020, v. 75, n. 2, p. 203, doi. 10.1002/net.21919
- By:
- Publication type:
- Article
3
A strong formulation for the graph partition problem.
- Published in:
- Networks, 2020, v. 75, n. 2, p. 183, doi. 10.1002/net.21916
- By:
- Publication type:
- Article
4
On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations.
- Published in:
- Networks, 2020, v. 75, n. 2, p. 158, doi. 10.1002/net.21915
- By:
- Publication type:
- Article
5
A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems.
- Published in:
- Networks, 2020, v. 75, n. 2, p. 137, doi. 10.1002/net.21914
- By:
- Publication type:
- Article
6
Complexity of inventory routing problems when routing is easy.
- Published in:
- Networks, 2020, v. 75, n. 2, p. 113, doi. 10.1002/net.21908
- By:
- Publication type:
- Article
7
A linear programming based approach to the Steiner tree problem with a fixed number of terminals.
- Published in:
- Networks, 2020, v. 75, n. 2, p. 124, doi. 10.1002/net.21913
- By:
- Publication type:
- Article