Exact algorithms for solving a Euclidean maximum flow network interdiction problem.
- Published in:
- Networks, 2014, v. 64, n. 2, p. 109, doi. 10.1002/net.21561
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2014 AND VI 64 AND IP 2
Results: 6
1
2
Bounds on the radius and status of graphs.
- Published in:
- Networks, 2014, v. 64, n. 2, p. 76, doi. 10.1002/net.21558
- By:
- Publication type:
- Article
3
Centroidal bases in graphs.
- Published in:
- Networks, 2014, v. 64, n. 2, p. 96, doi. 10.1002/net.21560
- By:
- Publication type:
- Article
4
Substitutes, complements, and ripples in multicommodity flows on suspension graphs.
- Published in:
- Networks, 2014, v. 64, n. 2, p. 65, doi. 10.1002/net.21557
- By:
- Publication type:
- Article
5
Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints.
- Published in:
- Networks, 2014, v. 64, n. 2, p. 125, doi. 10.1002/net.21562
- By:
- Publication type:
- Article
6
Online traveling salesman problems with rejection options.
- Published in:
- Networks, 2014, v. 64, n. 2, p. 84, doi. 10.1002/net.21559
- By:
- Publication type:
- Article