The degree-preserving spanning tree problem in strongly chordal and directed path graphs.
- Published in:
- Networks, 2010, v. 56, n. 3, p. 183, doi. 10.1002/net.20359
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2010 AND VI 56 AND IP 3
Results: 6
1
2
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation.
- Published in:
- Networks, 2010, v. 56, n. 3, p. 169, doi. 10.1002/net.20358
- By:
- Publication type:
- Article
3
An ejection chain algorithm for the quadratic assignment problem.
- Published in:
- Networks, 2010, v. 56, n. 3, p. 188, doi. 10.1002/net.20360
- By:
- Publication type:
- Article
4
Network flow spanners.
- Published in:
- Networks, 2010, v. 56, n. 3, p. 159, doi. 10.1002/net.20357
- By:
- Publication type:
- Article
5
A mean-variance model for the minimum cost flow problem with stochastic arc costs.
- Published in:
- Networks, 2010, v. 56, n. 3, p. 215, doi. 10.1002/net.20374
- By:
- Publication type:
- Article
6
Mixed search number and linear-width of interval and split graphs.
- Published in:
- Networks, 2010, v. 56, n. 3, p. 207, doi. 10.1002/net.20373
- By:
- Publication type:
- Article