Solving the undirected minimum cost flow problem with arbitrary costs.
- Published in:
- Networks, 2005, v. 45, n. 1, p. 1, doi. 10.1002/net.20042
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2005 AND VI 45 AND IP 1
Results: 6
1
2
Parallel scheduling problems in next generation wireless networks.
- Published in:
- Networks, 2005, v. 45, n. 1, p. 9, doi. 10.1002/net.20045
- By:
- Publication type:
- Article
3
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy.
- Published in:
- Networks, 2005, v. 45, n. 1, p. 36, doi. 10.1002/net.20047
- By:
- Publication type:
- Article
4
Adversarial models for priority-based networks.
- Published in:
- Networks, 2005, v. 45, n. 1, p. 23, doi. 10.1002/net.20044
- By:
- Publication type:
- Article
5
On the minimum number of wavelengths in multicast trees in WDM networks.
- Published in:
- Networks, 2005, v. 45, n. 1, p. 42, doi. 10.1002/net.20048
- By:
- Publication type:
- Article
6
Strict nonblockingness of reduced shuffle-exchange networks.
- Published in:
- Networks, 2005, v. 45, n. 1, p. 4, doi. 10.1002/net.20043
- By:
- Publication type:
- Article