Minimizing recovery cost of network optimization problems.
- Published in:
- Networks, 2023, v. 81, n. 1, p. 125, doi. 10.1002/net.22121
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2023 AND VI 81 AND IP 1
Results: 8
1
2
Fast upper and lower bounds for a large‐scale real‐world arc routing problem.
- Published in:
- Networks, 2023, v. 81, n. 1, p. 107, doi. 10.1002/net.22120
- By:
- Publication type:
- Article
3
Improving a constructive heuristic for the general routing problem.
- Published in:
- Networks, 2023, v. 81, n. 1, p. 93, doi. 10.1002/net.22119
- By:
- Publication type:
- Article
4
Capacity provisioning for evacuation on path networks.
- Published in:
- Networks, 2023, v. 81, n. 1, p. 75, doi. 10.1002/net.22118
- By:
- Publication type:
- Article
5
EETTlib—Energy‐efficient train timetabling library.
- Published in:
- Networks, 2023, v. 81, n. 1, p. 51, doi. 10.1002/net.22117
- By:
- Publication type:
- Article
6
Optimal deployment of indoor wireless local area networks.
- Published in:
- Networks, 2023, v. 81, n. 1, p. 23, doi. 10.1002/net.22116
- By:
- Publication type:
- Article
7
Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set.
- Published in:
- Networks, 2023, v. 81, n. 1, p. 3, doi. 10.1002/net.22114
- By:
- Publication type:
- Article
8
Issue Information.
- Published in:
- Networks, 2023, v. 81, n. 1, p. 1, doi. 10.1002/net.22102
- Publication type:
- Article