Integer programming models and algorithms for the graph decontamination problem with mobile agents.
- Published in:
- Networks, 2013, v. 61, n. 1, p. 1, doi. 10.1002/net.21460
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2013 AND VI 61 AND IP 1
Results: 6
1
2
Robust mean absolute deviation problems on networks with linear vertex weights.
- Published in:
- Networks, 2013, v. 61, n. 1, p. 76, doi. 10.1002/net.21471
- By:
- Publication type:
- Article
3
Proximity graphs inside large weighted graphs.
- Published in:
- Networks, 2013, v. 61, n. 1, p. 29, doi. 10.1002/net.21464
- By:
- Publication type:
- Article
4
A branch-and-bound algorithm for the double travelling salesman problem with two stacks.
- Published in:
- Networks, 2013, v. 61, n. 1, p. 58, doi. 10.1002/net.21468
- By:
- Publication type:
- Article
5
Simplifications and speedups of the pseudoflow algorithm.
- Published in:
- Networks, 2013, v. 61, n. 1, p. 40, doi. 10.1002/net.21467
- By:
- Publication type:
- Article
6
On the super-restricted arc-connectivity of s -geodetic digraphs.
- Published in:
- Networks, 2013, v. 61, n. 1, p. 20, doi. 10.1002/net.21462
- By:
- Publication type:
- Article