Issue Information.
- Published in:
- Networks, 2024, v. 83, n. 3, p. 469, doi. 10.1002/net.22153
- Publication type:
- Article
Works matching IS 00283045 AND DT 2024 AND VI 83 AND IP 3
Results: 9
1
2
Shortest path network interdiction with asymmetric uncertainty.
- Published in:
- Networks, 2024, v. 83, n. 3, p. 605, doi. 10.1002/net.22208
- By:
- Publication type:
- Article
3
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem.
- Published in:
- Networks, 2024, v. 83, n. 3, p. 547, doi. 10.1002/net.22206
- By:
- Publication type:
- Article
4
How vulnerable is an undirected planar graph with respect to max flow.
- Published in:
- Networks, 2024, v. 83, n. 3, p. 570, doi. 10.1002/net.22205
- By:
- Publication type:
- Article
5
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty.
- Published in:
- Networks, 2024, v. 83, n. 3, p. 587, doi. 10.1002/net.22204
- By:
- Publication type:
- Article
6
Asymptotic bounds for clustering problems in random graphs.
- Published in:
- Networks, 2024, v. 83, n. 3, p. 485, doi. 10.1002/net.22203
- By:
- Publication type:
- Article
7
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques.
- Published in:
- Networks, 2024, v. 83, n. 3, p. 527, doi. 10.1002/net.22202
- By:
- Publication type:
- Article
8
Learning to repeatedly solve routing problems.
- Published in:
- Networks, 2024, v. 83, n. 3, p. 503, doi. 10.1002/net.22200
- By:
- Publication type:
- Article
9
The complexity landscape of disaster‐aware network extension problems.
- Published in:
- Networks, 2024, v. 83, n. 3, p. 471, doi. 10.1002/net.22199
- By:
- Publication type:
- Article