Branch-and-cut techniques for solving realistic two-layer network designproblems

Arie M.C.A. Koster, S. Orlowski, Christian Raack, G. Baier, T. Engel, P. Belotti

In Graphs and Algorithms in Communication Networks, Springer Berlin Heidelberg (Koster, Arie M.C.A. and Muñoz, X., eds.) (2010), 95--118.

BibTex references

@InCollection\{KORBEB10,

author = "Koster, Arie M.C.A. and Orlowski, S. and Raack, Christian and Baier, G. and Engel, T. and Belotti, P.",

title = "Branch-and-cut techniques for solving realistic two-layer network designproblems",

booktitle = "Graphs and Algorithms in Communication Networks",

chapter = "3",

pages = "95--118",

year = "2010",

editor = "Koster, Arie M.C.A. and Muñoz, X.",

publisher = "Springer Berlin Heidelberg",

note = "http://dx.doi.org/10.1007/978-3-642-02250-0_3",

}