A branch-and-price algorithm for the ( k,c)-coloring problem.
- Published in:
- Networks, 2015, v. 65, n. 4, p. 353, doi. 10.1002/net.21579
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2015 AND VI 65 AND IP 4
Results: 9
1
2
Formulations and exact solution approaches for the degree preserving spanning tree problem.
- Published in:
- Networks, 2015, v. 65, n. 4, p. 329, doi. 10.1002/net.21590
- By:
- Publication type:
- Article
3
An incremental algorithm for the uncapacitated facility location problem.
- Published in:
- Networks, 2015, v. 65, n. 4, p. 306, doi. 10.1002/net.21595
- By:
- Publication type:
- Article
4
Network spot-checking games: Theory and application to toll enforcing in transportation networks.
- Published in:
- Networks, 2015, v. 65, n. 4, p. 312, doi. 10.1002/net.21596
- By:
- Publication type:
- Article
5
Stochastic maximum weight forest problem.
- Published in:
- Networks, 2015, v. 65, n. 4, p. 289, doi. 10.1002/net.21610
- By:
- Publication type:
- Article
6
On the complexity of equal shortest path routing.
- Published in:
- Networks, 2015, v. 65, n. 4, p. 344, doi. 10.1002/net.21612
- By:
- Publication type:
- Article
7
Preface.
- Published in:
- 2015
- By:
- Publication type:
- Editorial
8
Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem.
- Published in:
- Networks, 2015, v. 65, n. 4, p. 367, doi. 10.1002/net.21580
- By:
- Publication type:
- Article
9
Efficient Edge-swapping heuristics for the reload cost spanning tree problem.
- Published in:
- Networks, 2015, v. 65, n. 4, p. 380, doi. 10.1002/net.21609
- By:
- Publication type:
- Article