Items where Author is "Jünger, Michael"

2016

Cacchiani, V., Jünger, M., Liers, F., Lodi, A., & Schmidt, D. R. (2016). Single-commodity robust network design with finite and Hose demand sets. Mathematical Programming, 157(1), 297-342. External link

2015

Cacchiani, V., Jünger, M., Liers, F., Lodi, A., & Schmidt, D. R. (2015). Single-Commodity robust network design with finite and hose demand sets. (Technical Report). External link

2012

Álvarez-Miranda, E., Cacchiani, V., Dorneth, T., Jünger, M., Liers, F., Lodi, A., Parriani, T., & Schmidt, D. R. (2012, April). Models and algorithms for robust network design with several traffic scenarios [Paper]. 2nd International Symposium on Combinatorial Optimization (ISCO 2012), Athens, Greece. External link

2010

Lodi, A. (2010). Mixed integer programming computation. In Jünger, M., Liebling, T. M., Naddef, D., Nemhauser, G. L., Pulleyblank, W. R., Reinelt, G., Rinaldi, G., & Wolsey, L. A. (eds.), 50 years of integer programming 1958-2008 (pp. 619-645). External link

2005

Fischetti, M., & Lodi, A. (2005, June). Optimizing over the first Chvatal closure [Paper]. 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany. External link

2001

Fischetti, M., Lodi, A., & Toth, P. (2001, March). Solving real-world ATSP instances by branch-and-cut [Paper]. 5th International Workshop on Combinatorial Optimization, Aussois, France. External link