 | Monter d'un niveau |
Buchheim, C., Caprara, A., & Lodi, A. (2012). An effective branch-and-bound algorithm for convex quadratic integer programming. Mathematical Programming, 135(1-2), 369-395. Lien externe
Buchheim, C., Caprara, A., & Lodi, A. (juin 2010). An effective branch-and-bound algorithm for convex quadratic integer programming [Communication écrite]. 14th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2010), Lausanne, Suisse. Lien externe
Bizzarri, F., Buchheim, C., Callegari, S., Caprara, A., Lodi, A., Rovatti, R., & Setti, G. (octobre 2010). Practical solution of periodic filtered approximation as a convex quadratic integer program [Communication écrite]. 1st International Conference on Complex Systems Design and Management (CSDM 2010), Paris, France. Lien externe
Rostami, B., Kämmerling, N., Naoum-Sawaya, J., Buchheim, C., & Clausen, U. (2021). Stochastic single-allocation hub location. European Journal of Operational Research, 289(3), 1087-1106. Lien externe
Rostami, B., Kämmerling, N., Buchheim, C., Naoum-Sawaya, J., & Clausen, U. (2018). Stochastic single-allocation hub location. (Rapport technique n° DS4DM-2018-005). Lien externe
Rostami, B., Chassein, A., Hopf, M., Frey, D., Buchheim, C., Malucelli, F., & Goerigk, M. (2018). The quadratic shortest path problem: complexity, approximability, and solution methods. European Journal of Operational Research, 268(2), 473-485. Lien externe
Rostami, B., Kämmerling, N., Buchheim, C., & Clausen, U. (2018). Reliable single allocation hub location problem under hub breakdowns. Computers & Operations Research, 96, 15-29. Lien externe
