Traffic rate network tomography with higher‐order cumulants.
- Published in:
- Networks, 2023, v. 81, n. 2, p. 220, doi. 10.1002/net.22127
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2023 AND VI 81 AND IP 2
Results: 9
1
2
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks.
- Published in:
- Networks, 2023, v. 81, n. 2, p. 177, doi. 10.1002/net.22123
- By:
- Publication type:
- Article
3
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm.
- Published in:
- Networks, 2023, v. 81, n. 2, p. 204, doi. 10.1002/net.22124
- By:
- Publication type:
- Article
4
Formulations and valid inequalities for the capacitated dispersion problem.
- Published in:
- Networks, 2023, v. 81, n. 2, p. 294, doi. 10.1002/net.22132
- By:
- Publication type:
- Article
5
Optimizing the ecological connectivity of landscapes.
- Published in:
- Networks, 2023, v. 81, n. 2, p. 278, doi. 10.1002/net.22131
- By:
- Publication type:
- Article
6
The hazardous orienteering problem.
- Published in:
- Networks, 2023, v. 81, n. 2, p. 235, doi. 10.1002/net.22129
- By:
- Publication type:
- Article
7
Vertex covering with capacitated trees.
- Published in:
- Networks, 2023, v. 81, n. 2, p. 253, doi. 10.1002/net.22130
- By:
- Publication type:
- Article
8
Valid inequalities and facets for multi‐module survivable network design problem.
- Published in:
- Networks, 2023, v. 81, n. 2, p. 155, doi. 10.1002/net.22122
- By:
- Publication type:
- Article
9
Issue Information.
- Published in:
- Networks, 2023, v. 81, n. 2, p. 153, doi. 10.1002/net.22103
- Publication type:
- Article