<  Retour au portail Polytechnique Montréal

Documents dont l'auteur est "Caprara, Alberto"

Monter d'un niveau
Pour citer ou exporter [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Grouper par: Auteurs ou autrices | Date de publication | Sous-type de document | Aucun groupement
Aller à : B | C
Nombre de documents: 12

B

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

C

Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (2016). Bilevel knapsack with interdiction constraints. INFORMS Journal on Computing, 28(2), 319-333. Lien externe

Caprara, A., Furini, F., Lodi, A., Mangia, M., Rovatti, R., & Setti, G. (2014). Generation of antipodal random vectors with prescribed non-stationary 2-nd order statistics. IEEE Transactions on Signal Processing, 62(6), 1603-1612. Lien externe

Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (2014). A study on the computational complexity of the bilevel knapsack problem. SIAM Journal on Optimization, 24(2), 823-838. Lien externe

Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (mars 2013). A complexity and approximability study of the bilevel knapsack problem [Communication écrite]. 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), Valparaiso, Chile. Lien externe

Caprara, A., Lodi, A., & Monaci, M. (2010). An approximation scheme for the two-stage, two-dimensional knapsack problem. Discrete Optimization, 7(3), 114-124. Lien externe

Caprara, A., Lodi, A., Martello, S., & Monaci, M. (2006). Packing into the smallest square: worst-case analysis of lower bounds. Discrete Optimization, 3(4), 317-326. Lien externe

Caprara, A., Lodi, A., & Monaci, M. (2005). Fast approximation schemes for two-stage, two-dimensional bin packing. Mathematics of Operations Research, 30(1), 150-172. Lien externe

Caprara, A., Lodi, A., & Rizzi, R. (2004). On D-threshold graphs and D-dimensional bin packing. Networks, 44(4), 266-280. Lien externe

Caprara, A., Lodi, A., & Monaci, M. (mai 2002). An approximation scheme for the two-stage, two-dimensional bin packing problem [Communication écrite]. 9th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2002), Cambridge, MA, United states. Lien externe

Liste produite: Mon Apr 15 03:40:45 2024 EDT.