<  Back to the Polytechnique Montréal portal

Items where Author is "Frangioni, Antonio"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Publication Date | Document subtype | No Grouping
Jump to: 2024 | 2023 | 2021 | 2019 | 2017 | 2012 | 2010 | 2005 | 2004
Number of items: 16.

2024

Cacciola, M., Frangioni, A., & Lodi, A. (2024). Structured pruning of neural networks for constraints learning. Operations Research Letters, 57, 107194. External link

Crainic, T. G., Frangioni, A., & Gendreau, M. (2024). Bernard Gendron and Operations Research. In Combinatorial Optimization and Applications: A Tribute to Bernard Gendron (Vol. 358, 14 pages). External link

Crainic, T. G., Gendreau, M., & Frangioni, A. (2024). Combinatorial Optimization and Applications : A Tribute to Bernard Gendron. External link

2023

Cacciola, M., Frangioni, A., Asgharian, M., Ghaffari, A., & Nia, V. P. (2023, February). On the convergence of stochastic gradient descent in low-precision number formats [Paper]. 12th International Conference on Pattern Recognition Applications and Methods (ICPRAM 2023), Lisbon, Portugal. Available

Cacciola, M., Frangioni, A., Li, X.L., & Lodi, A. (2023). Deep neural networks pruning via the structured perspective regularization. SIAM Journal on Mathematics of Data Science, 5(4), 1051-1077. External link

2021

Hadjidimitriou, N. S., Frangioni, A., Koch, T., & Lodi, A. (eds.) (2021). Mathematical Optimization for Efficient and Robust Energy Networks. External link

2019

Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., Sahinidis, N. V., Vigerske, S., & Wiegele, A. (2019). QPLIB: a library of quadratic programming instances. Mathematical Programming Computation, 11(2), 237-265. External link

2017

Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., Sahinidis, N. V., Vigerske, S., & Wiegele, A. (2017). QPLIB: A library of quadratic programming instances. (Technical Report n° Optmization Online 5846). External link

2012

D'Ambrosio, C., Frangioni, A., Liberti, L., & Lodi, A. (2012, April). Extending feasibility pump to nonconvex mixed integer nonlinear programming problems [Paper]. 13ème Congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision (ROADEF 2012), Angers, France. Unavailable

D'Ambrosio, C., Frangioni, A., Liberti, L., & Lodi, A. (2012, March). Feasibility pump algorithms for nonconvex mixed integer nonlinear programming problems [Paper]. International Conference on Applied Mathematical Optimization and Modelling (APMOD 2012), Paderborn, Germany. Unavailable

D'Ambrosio, C., Frangioni, A., Liberti, L., & Lodi, A. (2010, April). A storm of feasibility pumps for nonconvex MINLP [Paper]. European Workshop on Mixed Integer Nonlinear Program-ming (EWMINLP 2010), Marseille, France. Published in Mathematical Programming, 136(2). External link

2010

D'Ambrosio, C., Frangioni, A., Liberti, L., & Lodi, A. (2010, May). Experiments with a feasibility pump approach for nonconvex MINLPs [Paper]. 9th International Symposium on Experimental Algorithms (SEA 2010), Naples, Italy. External link

D'Ambrosio, C., Frangioni, A., Liberti, L., & Lodi, A. (2010, April). Feasibility pump(s) for non-convex mixed-integer nonlinear programs [Paper]. European Workshop on Mixed Integer Nonlinear Programming, Marseille, France. Unavailable

D'Ambrosio, C., Frangioni, A., Liberti, L., & Lodi, A. (2010). On interval-subgradient and no-good cuts. Operations Research Letters, 38(5), 341-345. External link

2005

Frangioni, A., Lodi, A., & Rinaldi, G. (2005). New approaches for optimizing over the semimetric polytope. Mathematical Programming, 104(2-3), 375-388. External link

2004

Frangioni, A., Lodi, A., & Rinaldi, G. (2004, June). Optimizing over semimetric polytopes [Paper]. 10th International Integer Programming and Combinatorial Optimization Conference, New York, NY. External link

List generated on: Sun Jan 12 09:13:10 2025 EST