Efficient algorithms for a simple network design problem.
- Published in:
- Networks, 2013, v. 62, n. 2, p. 95, doi. 10.1002/net.21500
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2013 AND VI 62 AND IP 2
Results: 8
1
2
Complexity of a classical flow restoration problem.
- Published in:
- Networks, 2013, v. 62, n. 2, p. 149, doi. 10.1002/net.21508
- By:
- Publication type:
- Article
3
Analysis of an exact algorithm for the vessel speed optimization problem.
- Published in:
- Networks, 2013, v. 62, n. 2, p. 132, doi. 10.1002/net.21503
- By:
- Publication type:
- Article
4
Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs.
- Published in:
- Networks, 2013, v. 62, n. 2, p. 136, doi. 10.1002/net.21507
- By:
- Publication type:
- Article
5
The price of anarchy in nonatomic consumption-relevance congestion games.
- Published in:
- Networks, 2013, v. 62, n. 2, p. 83, doi. 10.1002/net.21499
- By:
- Publication type:
- Article
6
Complexity and approximability of the maximum flow problem with minimum quantities.
- Published in:
- Networks, 2013, v. 62, n. 2, p. 125, doi. 10.1002/net.21502
- By:
- Publication type:
- Article
7
Computation of the optimal value function in time-dependent networks.
- Published in:
- Networks, 2013, v. 62, n. 2, p. 105, doi. 10.1002/net.21501
- By:
- Publication type:
- Article
8
Single bend paths on a grid have strong helly number 4: errata atque emendationes ad 'edge intersection graphs of single bend paths on a grid'.
- Published in:
- Networks, 2013, v. 62, n. 2, p. 161, doi. 10.1002/net.21509
- By:
- Publication type:
- Article