Hop-level flow formulation for the survivable network design with hop constraints problem.
- Published in:
- Networks, 2013, v. 61, n. 2, p. 171, doi. 10.1002/net.21483
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2013 AND VI 61 AND IP 2
Results: 8
1
2
Editorial.
- Published in:
- Networks, 2013, v. 61, n. 2, p. 87, doi. 10.1002/net.21494
- By:
- Publication type:
- Article
3
Affine recourse for the robust network design problem: Between static and dynamic routing.
- Published in:
- Networks, 2013, v. 61, n. 2, p. 180, doi. 10.1002/net.21482
- By:
- Publication type:
- Article
4
Robust network design: Formulations, valid inequalities, and computations.
- Published in:
- Networks, 2013, v. 61, n. 2, p. 128, doi. 10.1002/net.21497
- By:
- Publication type:
- Article
5
Algebraic methods applied to shortest path and maximum flow problems in stochastic networks.
- Published in:
- Networks, 2013, v. 61, n. 2, p. 117, doi. 10.1002/net.21485
- By:
- Publication type:
- Article
6
The orienteering problem with variable profits.
- Published in:
- Networks, 2013, v. 61, n. 2, p. 104, doi. 10.1002/net.21496
- By:
- Publication type:
- Article
7
Stabilizing branch-and-price for constrained tree problems.
- Published in:
- Networks, 2013, v. 61, n. 2, p. 150, doi. 10.1002/net.21484
- By:
- Publication type:
- Article
8
A branch-and-cut algorithm for the ring spur assignment problem.
- Published in:
- Networks, 2013, v. 61, n. 2, p. 89, doi. 10.1002/net.21495
- By:
- Publication type:
- Article