Max flow vitality in general and st‐planar graphs.
- Published in:
- Networks, 2019, v. 74, n. 1, p. 70, doi. 10.1002/net.21878
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2019 AND VI 74 AND IP 1
Results: 7
1
2
Distributionally robust project crashing with partial or no correlation information.
- Published in:
- Networks, 2019, v. 74, n. 1, p. 79, doi. 10.1002/net.21880
- By:
- Publication type:
- Article
3
The Firefighter problem: Saving sets of vertices on cubic graphs.
- Published in:
- Networks, 2019, v. 74, n. 1, p. 62, doi. 10.1002/net.21873
- By:
- Publication type:
- Article
4
A new algorithm for the shortest‐path problem.
- Published in:
- Networks, 2019, v. 74, n. 1, p. 16, doi. 10.1002/net.21870
- By:
- Publication type:
- Article
5
Decomposable robust two‐stage optimization: An application to gas network operations under uncertainty.
- Published in:
- Networks, 2019, v. 74, n. 1, p. 40, doi. 10.1002/net.21871
- By:
- Publication type:
- Article
6
A branch‐and‐price algorithm for the rainbow cycle cover problems.
- Published in:
- Networks, 2019, v. 74, n. 1, p. 3, doi. 10.1002/net.21869
- By:
- Publication type:
- Article
7
Issue Information.
- Published in:
- Networks, 2019, v. 74, n. 1, p. 1, doi. 10.1002/net.21841
- Publication type:
- Article