Maximizing residual flow under an arc destruction.
- Published in:
- Networks, 2001, v. 38, n. 4, p. 194, doi. 10.1002/net.10001
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2001 AND VI 38 AND IP 4
Results: 6
1
2
A network based model of a promotion-sensitive grocery logistics system.
- Published in:
- Networks, 2001, v. 38, n. 4, p. 169, doi. 10.1002/net.10005
- By:
- Publication type:
- Article
3
The clique partitioning problem: Facets and patching facets.
- Published in:
- Networks, 2001, v. 38, n. 4, p. 209, doi. 10.1002/net.10004
- By:
- Publication type:
- Article
4
Low-cost minimum-time line-broadcasting schemes in complete binary trees.
- Published in:
- Networks, 2001, v. 38, n. 4, p. 189, doi. 10.1002/net.1036
- By:
- Publication type:
- Article
5
Area efficient layouts of the Batcher sorting networks.
- Published in:
- Networks, 2001, v. 38, n. 4, p. 199, doi. 10.1002/net.10003
- By:
- Publication type:
- Article
6
Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm.
- Published in:
- Networks, 2001, v. 38, n. 4, p. 181, doi. 10.1002/net.1035
- By:
- Publication type:
- Article