Appreciation to Referees.
- Published in:
- Networks, 2020, v. 76, n. 1, p. 122, doi. 10.1002/net.21946
- Publication type:
- Article
Works matching IS 00283045 AND DT 2020 AND VI 76 AND IP 1
Results: 8
1
2
Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs.
- Published in:
- Networks, 2020, v. 76, n. 1, p. 106, doi. 10.1002/net.21943
- By:
- Publication type:
- Article
3
A branch‐and‐cut approach for the least cost influence problem on social networks.
- Published in:
- Networks, 2020, v. 76, n. 1, p. 84, doi. 10.1002/net.21941
- By:
- Publication type:
- Article
4
Routing and scheduling of network flows with deadlines and discrete capacity allocation.
- Published in:
- Networks, 2020, v. 76, n. 1, p. 54, doi. 10.1002/net.21939
- By:
- Publication type:
- Article
5
Rational roots of all‐terminal reliability.
- Published in:
- Networks, 2020, v. 76, n. 1, p. 75, doi. 10.1002/net.21938
- By:
- Publication type:
- Article
6
Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows.
- Published in:
- Networks, 2020, v. 76, n. 1, p. 24, doi. 10.1002/net.21937
- By:
- Publication type:
- Article
7
The policy graph decomposition of multistage stochastic programming problems.
- Published in:
- Networks, 2020, v. 76, n. 1, p. 3, doi. 10.1002/net.21932
- By:
- Publication type:
- Article
8
Issue Information.
- Published in:
- Networks, 2020, v. 76, n. 1, p. 1, doi. 10.1002/net.21897
- Publication type:
- Article