Sub‐Tree Scheduling for Wireless Sensor Networks With Partial Coverage: Complexity and Polynomial‐Size Formulations.
- Published in:
- Networks, 2025, v. 85, n. 3, p. 326, doi. 10.1002/net.22265
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2025 AND VI 85 AND IP 3
Results: 7
1
2
An Improved Freight Transportation Planning System for Less‐Than‐Truckload Operations of a Third‐Party Logistics Carrier.
- Published in:
- Networks, 2025, v. 85, n. 3, p. 294, doi. 10.1002/net.22264
- By:
- Publication type:
- Article
3
Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem.
- Published in:
- Networks, 2025, v. 85, n. 3, p. 288, doi. 10.1002/net.22263
- By:
- Publication type:
- Article
4
A Polynomial Time Solvable Capacitated Arc Routing Problem on Regular Grid Graphs.
- Published in:
- Networks, 2025, v. 85, n. 3, p. 272, doi. 10.1002/net.22262
- By:
- Publication type:
- Article
5
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning.
- Published in:
- Networks, 2025, v. 85, n. 3, p. 261, doi. 10.1002/net.22261
- By:
- Publication type:
- Article
6
Optimizing Connected Components Graph Partitioning With Minimum Size Constraints Using Integer Programming and Spectral Clustering Techniques.
- Published in:
- Networks, 2025, v. 85, n. 3, p. 245, doi. 10.1002/net.22257
- By:
- Publication type:
- Article
7
Issue Information.
- Published in:
- Networks, 2025, v. 85, n. 3, p. 243, doi. 10.1002/net.22225
- Publication type:
- Article