The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case.
- Published in:
- Networks, 2008, v. 51, n. 2, p. 102, doi. 10.1002/net.20205
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2008 AND VI 51 AND IP 2
Results: 8
1
2
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints.
- Published in:
- Networks, 2008, v. 51, n. 2, p. 153, doi. 10.1002/net.20245
- By:
- Publication type:
- Article
3
A graph theory approach for designing conservation reserve networks with minimal fragmentation.
- Published in:
- Networks, 2008, v. 51, n. 2, p. 142, doi. 10.1002/net.20211
- By:
- Publication type:
- Article
4
Some edge-fault-tolerant properties of the folded hypercube.
- Published in:
- Networks, 2008, v. 51, n. 2, p. 92, doi. 10.1002/net.20204
- By:
- Publication type:
- Article
5
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs.
- Published in:
- Networks, 2008, v. 51, n. 2, p. 133, doi. 10.1002/net.20208
- By:
- Publication type:
- Article
6
New facets for the planar subgraph polytope.
- Published in:
- Networks, 2008, v. 51, n. 2, p. 120, doi. 10.1002/net.20207
- By:
- Publication type:
- Article
7
Editorial: 2006 Glover-Klingman Prize winners.
- Published in:
- Networks, 2008, v. 51, n. 2, p. 91, doi. 10.1002/net.20229
- By:
- Publication type:
- Article
8
Transversals of subtree hypergraphs and the source location problem in digraphs.
- Published in:
- Networks, 2008, v. 51, n. 2, p. 113, doi. 10.1002/net.20206
- By:
- Publication type:
- Article