Network flow models for designing diameter-constrained minimum-spanning and Steiner trees.
- Published in:
- Networks, 2003, v. 41, n. 3, p. 159, doi. 10.1002/net.10069
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2003 AND VI 41 AND IP 3
Results: 5
1
2
A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem (This work was carried out at CORE as part of a doctoral dissertation at l'Université Catholique de Louvain).
- Published in:
- Networks, 2003, v. 41, n. 3, p. 143, doi. 10.1002/net.10068
- By:
- Publication type:
- Article
3
The single-vehicle routing problem with unrestricted backhauls.
- Published in:
- Networks, 2003, v. 41, n. 3, p. 127, doi. 10.1002/net.10067
- By:
- Publication type:
- Article
4
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( <tex>$\bf\it\sqrt{n}m$</tex> log(n<sup>2</sup>/m)/log n) bound for the nonbipartite cardinality matching problem.
- Published in:
- Networks, 2003, v. 41, n. 3, p. 137, doi. 10.1002/net.10066
- By:
- Publication type:
- Article
5
Small-worlds: A review of recent books.
- Published in:
- Networks, 2003, v. 41, n. 3, p. 174, doi. 10.1002/net.10059
- By:
- Publication type:
- Article