default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Lodi 0001
Person information
- affiliation: Cornell Tech, New York, USA
- affiliation (former): École Polytechnique de Montréal, Quebec, Canada
- affiliation (former): Università di Bologna, DEI "Guglielmo Marconi", Italy
- not to be confused with: Andrea Lodi 0002
Other persons with the same name
- Andrea Lodi 0002 — University of Bologna, ARCES, Italy
- Andrea Lodi 0003 — imec, Heverlee, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j152]Margarida Carvalho, Gabriele Dragotto, Andrea Lodi, Sriram Sankaranarayanan:
Integer Programming Games. Found. Trends Optim. 7(4): 264-391 (2025)- [j151]Rui Chen
, Oktay Günlük, Andrea Lodi:
Recovering Dantzig-Wolfe Bounds by Cutting Planes. Oper. Res. 73(2): 1128-1142 (2025) - [i66]Jiachang Liu, Soroosh Shafiee, Andrea Lodi:
Scalable First-order Method for Certifying Optimal k-Sparse GLMs. CoRR abs/2502.09502 (2025) - 2024
- [j150]Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi:
An improved column-generation-based matheuristic for learning classification trees. Comput. Oper. Res. 165: 106579 (2024) - [j149]Nazgol Niroumandrad, Nadia Lahrichi, Andrea Lodi:
Learning tabu search algorithms: A scheduling application. Comput. Oper. Res. 170: 106751 (2024) - [j148]Jiaqi Liang, Sanjay Dominik Jena, Andrea Lodi:
Dynamic rebalancing optimization for bike-sharing systems: A modeling framework and empirical comparison. Eur. J. Oper. Res. 317(3): 875-889 (2024) - [j147]Andrea Lodi, Sriram Sankaranarayanan, Guanyi Wang:
A framework for fair decision-making over time with time-invariant utilities. Eur. J. Oper. Res. 319(2): 456-467 (2024) - [j146]Eric Larsen, Emma Frejinger, Bernard Gendron, Andrea Lodi:
Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning. INFORMS J. Comput. 36(1): 203-223 (2024) - [j145]Markus Leitner, Andrea Lodi, Roberto Roberti, Claudio Sole:
An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs. INFORMS J. Comput. 36(2): 479-494 (2024) - [j144]Gabriele Dragotto, Amine Boukhtouta, Andrea Lodi, Mehdi Taobane:
The critical node game. J. Comb. Optim. 47(5): 74 (2024) - [j143]Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi, Freddy Lécué:
Explainable prediction of Qcodes for NOTAMs using column generation. J. Oper. Res. Soc. 75(1): 173-183 (2024) - [j142]Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao:
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024) - [j141]Margarida Carvalho, Gabriele Dragotto, Felipe Feijoo, Andrea Lodi, Sriram Sankaranarayanan:
When Nash Meets Stackelberg. Manag. Sci. 70(10): 7308-7324 (2024) - [j140]Andrea Lodi, Philippe Olivier, Gilles Pesant, Sriram Sankaranarayanan:
Fairness over time in dynamic resource allocation with an application in healthcare. Math. Program. 203(1): 285-318 (2024) - [j139]Andrea Lodi, Enrico Malaguti, Michele Monaci, Giacomo Nannicini, Paolo Paronuzzi:
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions. Math. Program. 205(1): 269-301 (2024) - [j138]Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Learning to repeatedly solve routing problems. Networks 83(3): 503-526 (2024) - [j137]Matteo Cacciola, Antonio Frangioni, Andrea Lodi:
Structured pruning of neural networks for constraints learning. Oper. Res. Lett. 57: 107194 (2024) - [j136]Andreas M. Tillmann, Daniel Bienstock, Andrea Lodi, Alexandra Schwartz:
Cardinality Minimization, Constraints, and Regularization: A Survey. SIAM Rev. 66(3): 403-477 (2024) - [c60]Théo Barré, Omar El Housni, Andrea Lodi:
Assortment Optimization with Visibility Constraints. IPCO 2024: 124-138 - [c59]Bart van Rossum, Rui Chen, Andrea Lodi:
A New Branching Rule for Range Minimization Problems. IPCO 2024: 433-445 - [c58]Alfredo Torrico, Natthawut Boonsiriphatthanajaroen, Nikhil Garg, Andrea Lodi, Hugo Mainguy:
Equitable Congestion Pricing under the Markovian Traffic Model: An Application to Bogota. EC 2024: 4 - [i65]Jiaqi Liang, Sanjay Dominik Jena, Defeng Liu, Andrea Lodi:
A Reinforcement Learning Approach for Dynamic Rebalancing in Bike-Sharing System. CoRR abs/2402.03589 (2024) - [i64]Lara Scavuzzo, Karen I. Aardal, Andrea Lodi, Neil Yorke-Smith:
Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming. CoRR abs/2402.05501 (2024) - [i63]Andrea Lodi, Jasone Ramírez-Ayerbe:
One-for-many Counterfactual Explanations by Column Generation. CoRR abs/2402.09473 (2024) - [i62]Rosario Messana, Rui Chen, Andrea Lodi:
Actively Learning Combinatorial Optimization Using a Membership Oracle. CoRR abs/2405.14090 (2024) - [i61]Jiaqi Liang, Defeng Liu, Sanjay Dominik Jena, Andrea Lodi, Thibaut Vidal:
Dual Policy Reinforcement Learning for Real-time Rebalancing in Bike-sharing Systems. CoRR abs/2406.00868 (2024) - [i60]Igor Sadoune, Marcelin Joanis, Andrea Lodi:
Algorithmic Collusion And The Minimum Price Markov Game. CoRR abs/2407.03521 (2024) - [i59]Alfredo Torrico, Natthawut Boonsiriphatthanajaroen, Nikhil Garg, Andrea Lodi, Hugo Mainguy:
Equitable Congestion Pricing under the Markovian Traffic Model: An Application to Bogota. CoRR abs/2407.05035 (2024) - [i58]Jeff Decary, David Bergman, Carlos Cardonha, Jason Imbrogno, Andrea Lodi:
The Madness of Multiple Entries in March Madness. CoRR abs/2407.13438 (2024) - [i57]Matteo Cacciola, Alexandre Forel, Antonio Frangioni, Andrea Lodi:
The Differentiable Feasibility Pump. CoRR abs/2411.03535 (2024) - 2023
- [j135]Margarida Carvalho, Andrea Lodi:
A theoretical and computational equilibria analysis of a multi-player kidney exchange program. Eur. J. Oper. Res. 305(1): 373-385 (2023) - [j134]Defeng Liu, Vincent Perreault, Alain Hertz, Andrea Lodi:
A machine learning framework for neighbor generation in metaheuristic search. Frontiers Appl. Math. Stat. 9 (2023) - [j133]Claudio Contardo, Andrea Lodi, Andrea Tramontani:
Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities. INFORMS J. Comput. 35(1): 2-4 (2023) - [j132]Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Machine-Learning-Based Arc Selection for Constrained Shortest Path Problems in Column Generation. INFORMS J. Optim. 5(2): 191-210 (2023) - [j131]Borzou Rostami, Fausto Errico, Andrea Lodi:
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs. Oper. Res. 71(2): 471-486 (2023) - [j130]Quentin Cappart, Didier Chételat, Elias B. Khalil, Andrea Lodi, Christopher Morris, Petar Velickovic:
Combinatorial Optimization and Reasoning with Graph Neural Networks. J. Mach. Learn. Res. 24: 130:1-130:61 (2023) - [j129]Andrea Lodi, Mathieu Tanneau, Juan Pablo Vielma:
Disjunctive cuts in Mixed-Integer Conic Optimization. Math. Program. 199(1): 671-719 (2023) - [j128]Didier Chételat, Andrea Lodi:
Continuous cutting plane algorithms in integer programming. Oper. Res. Lett. 51(4): 439-445 (2023) - [j127]Matteo Cacciola, Antonio Frangioni, Xinlin Li, Andrea Lodi:
Deep Neural Networks Pruning via the Structured Perspective Regularization. SIAM J. Math. Data Sci. 5(4): 1051-1077 (2023) - [c57]Bart van Rossum, Rui Chen, Andrea Lodi:
Optimizing Fairness over Time with Homogeneous Workers (Short Paper). ATMOS 2023: 17:1-17:6 - [c56]Ítalo Santana, Andrea Lodi, Thibaut Vidal:
Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill? CPAIOR 2023: 184-199 - [c55]Federico Bobbio, Margarida Carvalho, Andrea Lodi, Ignacio Rios, Alfredo Torrico:
Capacity Planning in Stable Matching: An Application to School Choice. EC 2023: 295 - [i56]Gabriele Dragotto, Amine Boukhtouta, Andrea Lodi, Mehdi Taobane:
The Critical Node Game. CoRR abs/2303.05961 (2023) - [i55]Margarida Carvalho, Gabriele Dragotto, Andrea Lodi, Sriram Sankaranarayanan:
Integer Programming Games: A Gentle Computational Overview. CoRR abs/2306.02817 (2023) - [i54]Matteo Cacciola, Antonio Frangioni, Andrea Lodi:
Structured Pruning of Neural Networks for Constraints Learning. CoRR abs/2307.07457 (2023) - [i53]Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi:
Revisiting column-generation-based matheuristic for learning classification trees. CoRR abs/2308.11477 (2023) - 2022
- [j126]Philippe Olivier, Andrea Lodi, Gilles Pesant:
Measures of balance in combinatorial optimization. 4OR 20(3): 391-415 (2022) - [j125]Jaime E. González, André A. Ciré, Andrea Lodi, Louis-Martin Rousseau:
BDD-based optimization for the quadratic stable set problem. Discret. Optim. 44(Part): 100610 (2022) - [j124]Margarida Carvalho, Andrea Lodi, João Pedro Pedroso:
Computing equilibria for integer programming games. Eur. J. Oper. Res. 303(3): 1057-1070 (2022) - [j123]Leandro Rincon Costa, Daniel Aloise, Luca Giovanni Gianoli, Andrea Lodi:
Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds. J. Heuristics 28(4): 539-582 (2022) - [j122]Eric Larsen, Sébastien Lachapelle, Yoshua Bengio, Emma Frejinger, Simon Lacoste-Julien, Andrea Lodi:
Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information. INFORMS J. Comput. 34(1): 227-242 (2022) - [j121]David Bergman, Teng Huang, Philip Brooks, Andrea Lodi, Arvind U. Raghunathan:
JANOS: An Integrated Predictive and Prescriptive Modeling Framework. INFORMS J. Comput. 34(2): 807-816 (2022) - [j120]Sanjay Dominik Jena, Andrea Lodi, Claudio Sole:
On the Estimation of Discrete Choice Models to Capture Irrational Customer Behaviors. INFORMS J. Comput. 34(3): 1606-1625 (2022) - [j119]Borzou Rostami, Masoud Chitsaz, Okan Arslan, Gilbert Laporte, Andrea Lodi:
Single Allocation Hub Location with Heterogeneous Economies of Scale. Oper. Res. 70(2): 766-785 (2022) - [j118]Pierre Bonami, Andrea Lodi, Giulia Zarpellon:
A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX. Oper. Res. 70(6): 3303-3320 (2022) - [j117]Andrea Lodi, Enrico Malaguti, Giacomo Nannicini, Dimitri Thomopulos:
Nonlinear chance-constrained problems with applications to hydro scheduling. Math. Program. 191(1): 405-444 (2022) - [j116]Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros M. Gleixner, Andrea Lodi, Felipe Serrano:
On generalized surrogate duality in mixed-integer nonlinear programming. Math. Program. 192(1): 89-118 (2022) - [j115]Neta Gotlieb, Amirhossein Azhie, Divya Sharma, Ashley Spann, Nan-Ji Suo, Jason Tran, Ani Orchanian-Cheff, Bo Wang, Anna Goldenberg, Michael Chassé, Héloïse Cardinal, Joseph Paul Cohen, Andrea Lodi, Melanie Dieude, Mamatha Bhat:
The promise of machine learning applications in solid organ transplantation. npj Digit. Medicine 5 (2022) - [j114]Luca Accorsi, Andrea Lodi, Daniele Vigo:
Guidelines for the computational testing of machine learning approaches to vehicle routing problems. Oper. Res. Lett. 50(2): 229-234 (2022) - [j113]Santanu S. Dey, Aleksandr M. Kazachkov, Andrea Lodi, Gonzalo Muñoz:
Cutting Plane Generation through Sparse Principal Component Analysis. SIAM J. Optim. 32(2): 1319-1343 (2022) - [j112]Prateek Gupta, Elias Boutros Khalil, Didier Chételat, Maxime Gasse, Andrea Lodi, Yoshua Bengio, M. Pawan Kumar:
Lookback for Learning to Branch. Trans. Mach. Learn. Res. 2022 (2022) - [c54]Defeng Liu, Matteo Fischetti, Andrea Lodi:
Learning to Search in Local Branching. AAAI 2022: 3796-3803 - [c53]Elias B. Khalil, Christopher Morris, Andrea Lodi:
MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers. AAAI 2022: 10219-10227 - [c52]Jonathan Jalbert, Héloïse Cardinal, Andrea Lodi, Jean-Noël Weller, Hugo-Maxime Tocco:
Predicting Waiting Time and Quality of Kidney Offers for Kidney Transplant Candidates. AIME 2022: 220-229 - [c51]Nazgol Niroumandrad, Nadia Lahrichi, Andrea Lodi:
A Learning Metaheuristic Algorithm for a Scheduling Application. MIC 2022: 76-87 - [c50]Leandro Rincon Costa, Daniel Aloise, Luca Giovanni Gianoli, Andrea Lodi:
OptiMaP: swarm-powered Optimized 3D Mapping Pipeline for emergency response operations. DCOSS 2022: 269-276 - [c49]Abdel Ghani Labassi, Didier Chételat, Andrea Lodi:
Learning to Compare Nodes in Branch and Bound with Graph Neural Networks. NeurIPS 2022 - [c48]Lara Scavuzzo, Feng Yang Chen, Didier Chételat, Maxime Gasse, Andrea Lodi, Neil Yorke-Smith, Karen I. Aardal:
Learning to Branch with Tree MDPs. NeurIPS 2022 - [i52]Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Machine-learning-based arc selection for constrained shortest path problems in column generation. CoRR abs/2201.02535 (2022) - [i51]Maxime Gasse, Quentin Cappart, Jonas Charfreitag, Laurent Charlin, Didier Chételat, Antonia Chmiela, Justin Dumouchelle, Ambros M. Gleixner, Aleksandr M. Kazachkov, Elias B. Khalil, Pawel Lichocki, Andrea Lodi, Miles Lubin, Chris J. Maddison, Christopher Morris, Dimitri J. Papageorgiou, Augustin Parjadis, Sebastian Pokutta, Antoine Prouvost, Lara Scavuzzo, Giulia Zarpellon, Linxin Yang, Sha Lai, Akang Wang, Xiaodong Luo, Xiang Zhou, Haohan Huang, Sheng Cheng Shao, Yuanming Zhu, Dong Zhang, Tao Quan, Zixuan Cao, Yang Xu, Zhewei Huang, Shuchang Zhou, Binbin Chen, Minggui He, Hao Hao, Zhiyu Zhang, Zhiwu An, Kun Mao:
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. CoRR abs/2203.02433 (2022) - [i50]Eric Larsen, Emma Frejinger, Bernard Gendron, Andrea Lodi:
Fast Continuous and Integer L-shaped Heuristics Through Supervised Learning. CoRR abs/2205.00897 (2022) - [i49]Federico Bobbio, Margarida Carvalho, Andrea Lodi, Alfredo Torrico:
Capacity Variation in the Many-to-one Stable Matching. CoRR abs/2205.01302 (2022) - [i48]Lara Scavuzzo, Feng Yang Chen, Didier Chételat, Maxime Gasse, Andrea Lodi, Neil Yorke-Smith, Karen I. Aardal:
Learning to branch with Tree MDPs. CoRR abs/2205.11107 (2022) - [i47]Elias B. Khalil, Christopher Morris, Andrea Lodi:
MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers. CoRR abs/2205.14210 (2022) - [i46]Dounia Lakhmiri, Dominique Orban, Andrea Lodi:
A Stochastic Proximal Method for Nonsmooth Regularized Finite Sum Optimization. CoRR abs/2206.06531 (2022) - [i45]Matteo Cacciola, Antonio Frangioni, Xinlin Li, Andrea Lodi:
Deep Neural Networks pruning via the Structured Perspective Regularization. CoRR abs/2206.14056 (2022) - [i44]Prateek Gupta, Elias B. Khalil, Didier Chételat, Maxime Gasse, Yoshua Bengio, Andrea Lodi, M. Pawan Kumar:
Lookback for Learning to Branch. CoRR abs/2206.14987 (2022) - [i43]Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi, Freddy Lécué:
Explainable prediction of Qcodes for NOTAMs using column generation. CoRR abs/2208.04955 (2022) - [i42]Ítalo Santana, Andrea Lodi, Thibaut Vidal:
Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill? CoRR abs/2210.12075 (2022) - [i41]Abdel Ghani Labassi, Didier Chételat, Andrea Lodi:
Learning to Compare Nodes in Branch and Bound with Graph Neural Networks. CoRR abs/2210.16934 (2022) - [i40]Rui Chen, Oktay Günlük, Andrea Lodi, Guanyi Wang:
A Simple Algorithm for Online Decision Making. CoRR abs/2211.03997 (2022) - [i39]Ruobing Shen, Bo Tang, Andrea Lodi, Ismail Ben Ayed, Thomas Guthier:
Connectivity-constrained Interactive Panoptic Segmentation. CoRR abs/2212.06756 (2022) - [i38]Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Learning to repeatedly solve routing problems. CoRR abs/2212.08101 (2022) - [i37]Defeng Liu, Vincent Perreault, Alain Hertz, Andrea Lodi:
A machine learning framework for neighbor generation in metaheuristic search. CoRR abs/2212.11451 (2022) - [i36]Emma Frejinger, Andrea Lodi, Michele Lombardi, Neil Yorke-Smith:
Data-Driven Combinatorial Optimisation (Dagstuhl Seminar 22431). Dagstuhl Reports 12(10): 166-174 (2022) - 2021
- [j111]Maha Gmira, Michel Gendreau, Andrea Lodi, Jean-Yves Potvin:
Tabu search for the time-dependent vehicle routing problem with time windows on a road network. Eur. J. Oper. Res. 288(1): 129-140 (2021) - [j110]Yoshua Bengio, Andrea Lodi, Antoine Prouvost:
Machine learning for combinatorial optimization: A methodological tour d'horizon. Eur. J. Oper. Res. 290(2): 405-421 (2021) - [j109]Philippe Olivier, Andrea Lodi, Gilles Pesant:
The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints. INFORMS J. Comput. 33(3): 949-962 (2021) - [j108]Borzou Rostami, Guy Desaulniers, Fausto Errico, Andrea Lodi:
Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times. Oper. Res. 69(2): 436-455 (2021) - [j107]Andrea Baggio, Margarida Carvalho, Andrea Lodi, Andrea Tramontani:
Multilevel Approaches for the Critical Node Problem. Oper. Res. 69(2): 486-508 (2021) - [j106]Leandro Rincon Costa, Daniel Aloise, Luca Giovanni Gianoli, Andrea Lodi:
The Covering-Assignment Problem for Swarm-Powered Ad Hoc Clouds: A Distributed 3-D Mapping Usecase. IEEE Internet Things J. 8(9): 7316-7332 (2021) - [j105]Defeng Liu, Andrea Lodi, Mathieu Tanneau:
Learning chordal extensions. J. Glob. Optim. 81(1): 3-22 (2021) - [j104]Mathieu Tanneau, Miguel F. Anjos, Andrea Lodi:
Design and implementation of a modular interior-point solver for linear optimization. Math. Program. Comput. 13(3): 509-551 (2021) - [j103]Miguel F. Anjos, Youssouf Emine, Andrea Lodi, Zhao Sun:
A note on the Lasserre hierarchy for different formulations of the maximum independent set problem. Oper. Res. Lett. 49(1): 30-34 (2021) - [j102]Teodora Dan, Andrea Lodi, Patrice Marcotte:
An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints. SIAM J. Optim. 31(1): 275-306 (2021) - [j101]Karen I. Aardal, Andrea Lodi, Andrea Tramontani, Frederik von Heymann, Laurence A. Wolsey:
Lattice Reformulation Cuts. SIAM J. Optim. 31(4): 2539-2557 (2021) - [j100]Mouad Morabit, Guy Desaulniers, Andrea Lodi:
Machine-Learning-Based Column Selection for Column Generation. Transp. Sci. 55(4): 815-831 (2021) - [c47]Giulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua Bengio:
Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies. AAAI 2021: 3931-3939 - [c46]Christopher Neal, Hanane Dagdougui, Andrea Lodi, José M. Fernandez:
Reinforcement Learning Based Penetration Testing of a Microgrid Control Algorithm. CCWC 2021: 38-44 - [c45]Defeng Liu, Andrea Lodi:
Learning in Local Branching (Invited Talk). CP 2021: 3:1-3:2 - [c44]Quentin Cappart, Didier Chételat, Elias B. Khalil, Andrea Lodi, Christopher Morris, Petar Velickovic:
Combinatorial Optimization and Reasoning with Graph Neural Networks. IJCAI 2021: 4348-4355 - [c43]Maxime Gasse, Simon Bowly, Quentin Cappart, Jonas Charfreitag, Laurent Charlin, Didier Chételat, Antonia Chmiela, Justin Dumouchelle, Ambros M. Gleixner, Aleksandr M. Kazachkov, Elias B. Khalil, Pawel Lichocki, Andrea Lodi, Miles Lubin, Chris J. Maddison, Christopher Morris, Dimitri J. Papageorgiou, Augustin Parjadis, Sebastian Pokutta, Antoine Prouvost, Lara Scavuzzo, Giulia Zarpellon, Linxin Yang, Sha Lai, Akang Wang, Xiaodong Luo, Xiang Zhou, Haohan Huang, Sheng Cheng Shao, Yuanming Zhu, Dong Zhang, Tao Quan, Zixuan Cao, Yang Xu, Zhewei Huang, Shuchang Zhou, Binbin Chen, Minggui He, Hao Hao, Zhiyu Zhang, Zhiwu An, Kun Mao:
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. NeurIPS (Competition and Demos) 2021: 220-231 - [c42]Antonia Chmiela, Elias B. Khalil, Ambros M. Gleixner, Andrea Lodi, Sebastian Pokutta:
Learning to Schedule Heuristics in Branch and Bound. NeurIPS 2021: 24235-24246 - [c41]Tristan Sylvain, Margaux Luck, Joseph Paul Cohen, Héloïse Cardinal, Andrea Lodi, Yoshua Bengio:
Exploring the Wasserstein metric for time-to-event analysis. SPACA 2021: 194-206 - [i35]Greta Laage, Emma Frejinger, William L. Hamilton, Andrea Lodi, Guillaume Rabusseau:
Estimating the Impact of an Improvement to a Revenue Management System: An Airline Application. CoRR abs/2101.10249 (2021) - [i34]Justin Dumouchelle, Emma Frejinger, Andrea Lodi:
Can Machine Learning Help in Solving Cargo Capacity Management Booking Control Problems? CoRR abs/2102.00092 (2021) - [i33]Léa Ricard, Guy Desaulniers, Andrea Lodi, Louis-Martin Rousseau:
Predicting the probability distribution of bus travel time to move towards reliable planning of public transport services. CoRR abs/2102.02292 (2021) - [i32]Quentin Cappart, Didier Chételat, Elias B. Khalil, Andrea Lodi, Christopher Morris, Petar Velickovic:
Combinatorial optimization and reasoning with graph neural networks. CoRR abs/2102.09544 (2021) - [i31]Antonia Chmiela, Elias B. Khalil, Ambros M. Gleixner, Andrea Lodi, Sebastian Pokutta:
Learning to Schedule Heuristics in Branch-and-Bound. CoRR abs/2103.10294 (2021) - [i30]Antoine Prouvost, Justin Dumouchelle, Maxime Gasse, Didier Chételat, Andrea Lodi:
Ecole: A Library for Learning Inside MILP Solvers. CoRR abs/2104.02828 (2021) - [i29]Andreas M. Tillmann, Daniel Bienstock, Andrea Lodi, Alexandra Schwartz:
Cardinality Minimization, Constraints, and Regularization: A Survey. CoRR abs/2106.09606 (2021) - [i28]Sanjay Dominik Jena, Andrea Lodi, Claudio Sole:
On the estimation of discrete choice models to capture irrational customer behaviors. CoRR abs/2109.03882 (2021) - [i27]Luca Accorsi, Andrea Lodi, Daniele Vigo:
Guidelines for the Computational Testing of Machine Learning approaches to Vehicle Routing Problems. CoRR abs/2109.13983 (2021) - [i26]Federico Bobbio, Margarida Carvalho, Andrea Lodi, Alfredo Torrico:
Capacity Expansion in the College Admission Problem. CoRR abs/2110.00734 (2021) - [i25]Margarida Carvalho, Gabriele Dragotto, Andrea Lodi, Sriram Sankaranarayanan:
The Cut and Play Algorithm: Computing Nash Equilibria via Outer Approximations. CoRR abs/2111.05726 (2021) - [i24]Gabriele Dragotto, Sriram Sankaranarayanan, Margarida Carvalho, Andrea Lodi:
ZERO: Playing Mathematical Programming Games. CoRR abs/2111.07932 (2021) - [i23]Sanae Lotfi, Tiphaine Bonniot de Ruisselet, Dominique Orban, Andrea Lodi:
Adaptive First- and Second-Order Algorithms for Large-Scale Machine Learning. CoRR abs/2111.14761 (2021) - [i22]Defeng Liu, Matteo Fischetti, Andrea Lodi:
Learning to Search in Local Branching. CoRR abs/2112.02195 (2021) - 2020
- [j99]Jaime E. González, André Augusto Ciré, Andrea Lodi, Louis-Martin Rousseau:
Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem. Constraints An Int. J. 25(1-2): 23-46 (2020) - [j98]Teodora Dan, Andrea Lodi, Patrice Marcotte:
Joint location and pricing within a user-optimized environment. EURO J. Comput. Optim. 8(1): 61-84 (2020) - [j97]Maha Gmira, Michel Gendreau, Andrea Lodi, Jean-Yves Potvin:
Travel speed prediction based on learning methods for home delivery. EURO J. Transp. Logist. 9(4): 100006 (2020) - [j96]Andrea Lodi, Luca Mossina, Emmanuel Rachelson:
Learning to handle parameter perturbations in Combinatorial Optimization: An application to facility location. EURO J. Transp. Logist. 9(4): 100023 (2020) - [j95]Tien Mai, Andrea Lodi:
A multicut outer-approximation approach for competitive facility location under random utilities. Eur. J. Oper. Res. 284(3): 874-881 (2020) - [j94]Miguel F. Anjos, Fabian Bastin, Sébastien Le Digabel, Andrea Lodi:
Preface to the special issue of INFOR on "continuous optimization and applications in machine learning and data analytics". INFOR Inf. Syst. Oper. Res. 58(2): 167 (2020) - [j93]Sanjay Dominik Jena, Andrea Lodi, Hugo Palmer, Claudio Sole:
A Partially Ranked Choice Model for Large-Scale Data-Driven Assortment Optimization. INFORMS J. Optim. 2(4): 297-319 (2020) - [j92]Ruobing Shen, Bo Tang, Andrea Lodi, Andrea Tramontani, Ismail Ben Ayed:
An ILP Model for Multi-Label MRFs With Connectivity Constraints. IEEE Trans. Image Process. 29: 6909-6917 (2020) - [c40]Christopher Neal, Ranwa Al Mallah, José M. Fernandez, Andrea Lodi:
Analyzing the Resiliency of Microgrid Control Algorithms Against Malicious Input. CCECE 2020: 1-6 - [c39]Yoshua Bengio, Emma Frejinger, Andrea Lodi, Rahul Patel, Sriram Sankaranarayanan:
A Learning-Based Algorithm to Quickly Compute Good Primal Solutions for Stochastic Integer Programs. CPAIOR 2020: 99-111 - [c38]Farnoush Farhadi, Vahid Partovi Nia, Andrea Lodi:
Activation Adaptation in Neural Networks. ICPRAM 2020: 249-257 - [c37]Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros M. Gleixner, Andrea Lodi, Felipe Serrano:
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming. IPCO 2020: 322-337 - [c36]Prateek Gupta, Maxime Gasse, Elias B. Khalil, Pawan Kumar Mudigonda, Andrea Lodi, Yoshua Bengio:
Hybrid Models for Learning to Branch. NeurIPS 2020 - [i21]Giulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua Bengio:
Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies. CoRR abs/2002.05120 (2020) - [i20]Alfredo Torrico, Margarida Carvalho, Andrea Lodi:
Provable Guarantees for General Two-sided Sequential Matching Markets. CoRR abs/2006.04313 (2020) - [i19]Prateek Gupta, Maxime Gasse, Elias B. Khalil, M. Pawan Kumar, Andrea Lodi, Yoshua Bengio:
Hybrid Models for Learning to Branch. CoRR abs/2006.15212 (2020) - [i18]Christopher Neal, Hanane Dagdougui, Andrea Lodi, José M. Fernandez:
Reinforcement Learning Based Penetration Testing of a Microgrid Control Algorithm. CoRR abs/2008.13212 (2020) - [i17]Aurélien Serre, Didier Chételat, Andrea Lodi:
Change Point Detection by Cross-Entropy Maximization. CoRR abs/2009.01358 (2020) - [i16]Antoine Prouvost, Justin Dumouchelle, Lara Scavuzzo, Maxime Gasse, Didier Chételat, Andrea Lodi:
Ecole: A Gym-like Library for Machine Learning in Combinatorial Optimization Solvers. CoRR abs/2011.06069 (2020) - [i15]Sanae Lotfi, Tiphaine Bonniot de Ruisselet, Dominique Orban, Andrea Lodi:
Stochastic Damped L-BFGS with Controlled Norm of the Hessian Approximation. CoRR abs/2012.05783 (2020) - [i14]Margarida Carvalho, Andrea Lodi, João Pedro Pedroso:
Computing Nash equilibria for integer programming games. CoRR abs/2012.07082 (2020)
2010 – 2019
- 2019
- [j91]Timo Berthold, Andrea Lodi, Domenico Salvagnin:
Ten years of feasibility pump, and counting. EURO J. Comput. Optim. 7(1): 1-14 (2019) - [j90]Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros M. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele:
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2): 237-265 (2019) - [j89]Pierre Bonami, Andrea Lodi, Jonas Schweiger, Andrea Tramontani:
Solving Quadratic Programming by Cutting Planes. SIAM J. Optim. 29(2): 1076-1105 (2019) - [c35]Pierre Coste, Andrea Lodi, Gilles Pesant:
Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems. CPAIOR 2019: 182-191 - [c34]Martina Fischetti, Andrea Lodi, Giulia Zarpellon:
Learning MILP Resolution Outcomes Before Reaching Time-Limit. CPAIOR 2019: 275-291 - [c33]Maxime Gasse, Didier Chételat, Nicola Ferroni, Laurent Charlin, Andrea Lodi:
Exact Combinatorial Optimization with Graph Convolutional Neural Networks. NeurIPS 2019: 15554-15566 - [e3]Andrea Lodi, Viswanath Nagarajan:
Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings. Lecture Notes in Computer Science 11480, Springer 2019, ISBN 978-3-030-17952-6 [contents] - [i13]Farnoush Farhadi, Vahid Partovi Nia, Andrea Lodi:
Activation Adaptation in Neural Networks. CoRR abs/1901.09849 (2019) - [i12]Maxime Gasse, Didier Chételat, Nicola Ferroni, Laurent Charlin, Andrea Lodi:
Exact Combinatorial Optimization with Graph Convolutional Neural Networks. CoRR abs/1906.01629 (2019) - [i11]Andrea Lodi, Luca Mossina, Emmanuel Rachelson:
Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location. CoRR abs/1907.05765 (2019) - [i10]Margarida Carvalho, Gabriele Dragotto, Felipe Feijoo, Andrea Lodi, Sriram Sankaranarayanan:
Nash Games Among Stackelberg Leaders. CoRR abs/1910.06452 (2019) - [i9]Defeng Liu, Andrea Lodi, Mathieu Tanneau:
Learning chordal extensions. CoRR abs/1910.07600 (2019) - [i8]Margarida Carvalho, Andrea Lodi:
Game theoretical analysis of Kidney Exchange Programs. CoRR abs/1911.09207 (2019) - [i7]David Bergman, Teng Huang, Philip Brooks, Andrea Lodi, Arvind U. Raghunathan:
JANOS: An Integrated Predictive and Prescriptive Modeling Framework. CoRR abs/1911.09461 (2019) - [i6]Yoshua Bengio, Emma Frejinger, Andrea Lodi, Rahul Patel, Sriram Sankaranarayanan:
A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs. CoRR abs/1912.08112 (2019) - 2018
- [j88]Melchiorre Danilo Abrignani, Lorenza Giupponi, Andrea Lodi, Roberto Verdone:
Scheduling M2M traffic over LTE uplink of a dense small cell network. EURASIP J. Wirel. Commun. Netw. 2018: 193 (2018) - [j87]Andrea Lodi, Ahmad Moradi:
Experiments on virtual private network design with concave capacity costs. Optim. Lett. 12(5): 945-957 (2018) - [j86]Margarida Carvalho, Andrea Lodi, Patrice Marcotte:
A polynomial algorithm for a continuous bilevel knapsack problem. Oper. Res. Lett. 46(2): 185-188 (2018) - [j85]Claudio Gambella, Andrea Lodi, Daniele Vigo:
Exact Solutions for the Carrier-Vehicle Traveling Salesman Problem. Transp. Sci. 52(2): 320-330 (2018) - [c32]Philippe Olivier, Andrea Lodi, Gilles Pesant:
A Comparison of Optimization Methods for Multi-objective Constrained Bin Packing Problems. CPAIOR 2018: 462-476 - [c31]Pierre Bonami, Andrea Lodi, Giulia Zarpellon:
Learning a Classification of Mixed-Integer Quadratic Programming Problems. CPAIOR 2018: 595-604 - [i5]Margaux Luck, Tristan Sylvain, Joseph Paul Cohen, Héloïse Cardinal, Andrea Lodi, Yoshua Bengio:
Learning to rank for censored survival data. CoRR abs/1806.01984 (2018) - [i4]Eric Larsen, Sébastien Lachapelle, Yoshua Bengio, Emma Frejinger, Simon Lacoste-Julien, Andrea Lodi:
Predicting Solution Summaries to Integer Linear Programs under Imperfect Information with Machine Learning. CoRR abs/1807.11876 (2018) - [i3]Yoshua Bengio, Andrea Lodi, Antoine Prouvost:
Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon. CoRR abs/1811.06128 (2018) - 2017
- [j84]Andrea Lodi, Michele Monaci, Enrico Pietrobuoni:
Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints. Discret. Appl. Math. 217: 40-47 (2017) - [j83]Claudia D'Ambrosio, Antonio Frangioni, Andrea Lodi, Martin Mevissen:
Special issue on: Nonlinear and combinatorial methods for energy optimization. EURO J. Comput. Optim. 5(1-2): 1-3 (2017) - [j82]Margarida Carvalho, Andrea Lodi, João Pedro Pedroso, Ana Viana:
Nash equilibria in the two-player kidney exchange game. Math. Program. 161(1-2): 389-417 (2017) - [j81]Samuel Rosat, Issmail Elhallaoui, François Soumis, Andrea Lodi:
Integral simplex using decomposition with primal cutting planes. Math. Program. 166(1-2): 327-367 (2017) - [c30]Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese:
Cutting Planes from Wide Split Disjunctions. IPCO 2017: 99-110 - [i2]Margaux Luck, Tristan Sylvain, Héloïse Cardinal, Andrea Lodi, Yoshua Bengio:
Deep Learning for Patient-Specific Kidney Graft Survival Analysis. CoRR abs/1705.10245 (2017) - [i1]Ruobing Shen, Eric Kendinibilir, Ismail Ben Ayed, Andrea Lodi, Andrea Tramontani, Gerhard Reinelt:
An ILP Solver for Multi-label MRFS with Connectivity Constraints. CoRR abs/1712.06020 (2017) - 2016
- [j80]Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez, Domenico Salvagnin:
On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. 65(3): 545-566 (2016) - [j79]Luis Eduardo Neves Gouveia, Andrea Lodi, Ali Ridha Mahjoub:
Preface. Discret. Optim. 22: 1-5 (2016) - [j78]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
Bilevel Knapsack with Interdiction Constraints. INFORMS J. Comput. 28(2): 319-333 (2016) - [j77]Andrea Lodi, Enrico Malaguti, Nicolás E. Stier Moses, Tommaso Bonino:
Design and Control of Public-Service Contracts and an Application to Public Transportation Systems. Manag. Sci. 62(4): 1165-1187 (2016) - [j76]Valentina Cacchiani, Michael Jünger, Frauke Liers, Andrea Lodi, Daniel R. Schmidt:
Single-commodity robust network design with finite and Hose demand sets. Math. Program. 157(1): 297-342 (2016) - [j75]Matteo Fischetti, Andrea Lodi, Michele Monaci, Domenico Salvagnin, Andrea Tramontani:
Improving branch-and-cut performance by random sampling. Math. Program. Comput. 8(1): 113-132 (2016) - 2015
- [j74]Claudia D'Ambrosio, Andrea Lodi, Sven Wiese, Cristiana Bragalli:
Mathematical programming techniques in water network optimization. Eur. J. Oper. Res. 243(3): 774-788 (2015) - [j73]Claudia D'Ambrosio, Andrea Lodi, Sven Wiese, Cristiana Bragalli:
Erratum to "Mathematical programming techniques in water network optimization" [Eur. J. Oper. Res. 243(2015) 774-788]. Eur. J. Oper. Res. 245(1): 338 (2015) - [j72]Pierre Bonami, Andrea Lodi, Andrea Tramontani, Sven Wiese:
On mathematical programming with indicator constraints. Math. Program. 151(1): 191-223 (2015) - [j71]Ahmad Moradi, Andrea Lodi, S. Mehdi Hashemi:
Virtual private network design over the first Chvátal closure. RAIRO Oper. Res. 49(3): 569-588 (2015) - [c29]M. Danilo Abrignani, Lorenza Giupponi, Andrea Lodi, Roberto Verdone:
Scheduling M2M traffic over LTE uplink of a dense small cells network. ISWCS 2015: 760-764 - 2014
- [j70]Eduardo Álvarez-Miranda, Valentina Cacchiani, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt:
Single-commodity robust network design problem: Complexity, instances and heuristic solutions. Eur. J. Oper. Res. 238(3): 711-723 (2014) - [j69]Riccardo Rovatti, Claudia D'Ambrosio, Andrea Lodi, Silvano Martello:
Optimistic MILP modeling of non-linear optimization problems. Eur. J. Oper. Res. 239(1): 32-45 (2014) - [j68]Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey:
On the Practical Strength of Two-Row Tableau Cuts. INFORMS J. Comput. 26(2): 222-237 (2014) - [j67]Andrea Lodi, Ted K. Ralphs, Gerhard J. Woeginger:
Bilevel programming and the separation problem. Math. Program. 146(1-2): 437-458 (2014) - [j66]Ahmad Moradi, Andrea Lodi, S. Mehdi Hashemi:
On the difficulty of virtual private network instances. Networks 63(4): 327-333 (2014) - [j65]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Study on the Computational Complexity of the Bilevel Knapsack Problem. SIAM J. Optim. 24(2): 823-838 (2014) - [j64]Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci:
Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA. IEEE/ACM Trans. Netw. 22(5): 1645-1658 (2014) - [j63]Alberto Caprara, Fabio Furini, Andrea Lodi, Mauro Mangia, Riccardo Rovatti, Gianluca Setti:
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics. IEEE Trans. Signal Process. 62(6): 1603-1612 (2014) - [c28]Andrea Lodi, Paolo Tubertini, Roberto Grilli, Francesca Senese:
Tactical Versus Operational Discrete Event Simulation: A Breast Screening Case Study. ECMS 2014: 796-802 - [c27]Andrea Rudi, Andrea Bartolini, Andrea Lodi, Luca Benini:
Optimum: Thermal-aware task allocation for heterogeneous many-core devices. HPCS 2014: 82-87 - [c26]Samuel Rosat, Issmail Elhallaoui, François Soumis, Andrea Lodi:
Integral Simplex Using Decomposition with Primal Cuts. SEA 2014: 22-33 - 2013
- [j62]Claudia D'Ambrosio, Andrea Lodi:
Mixed integer nonlinear programming tools: an updated practical overview. Ann. Oper. Res. 204(1): 301-320 (2013) - [j61]Jelle Duives, Andrea Lodi, Enrico Malaguti:
Test-assignment: a quadratic coloring problem. J. Heuristics 19(4): 549-564 (2013) - [c25]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Complexity and Approximability Study of the Bilevel Knapsack Problem. IPCO 2013: 98-109 - [p4]Andrea Lodi:
The Heuristic (Dark) Side of MIP Solvers. Hybrid Metaheuristics 2013: 273-284 - 2012
- [j60]Mohammad Dolatabadi, Andrea Lodi, Michele Monaci:
Exact algorithms for the two-dimensional guillotine knapsack. Comput. Oper. Res. 39(1): 48-53 (2012) - [j59]Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini:
Bounding, filtering and diversification in CP-based local branching. J. Heuristics 18(3): 353-374 (2012) - [j58]Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani:
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24(1): 132-147 (2012) - [j57]Christoph Buchheim, Alberto Caprara, Andrea Lodi:
An effective branch-and-bound algorithm for convex quadratic integer programming. Math. Program. 135(1-2): 369-395 (2012) - [j56]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
A storm of feasibility pumps for nonconvex MINLP. Math. Program. 136(2): 375-402 (2012) - [j55]Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger:
Complexity and approximation of an area packing problem. Optim. Lett. 6(1): 1-9 (2012) - [c24]Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt:
Models and Algorithms for Robust Network Design with Several Traffic Scenarios. ISCO 2012: 261-272 - 2011
- [j54]Claudia D'Ambrosio, Andrea Lodi:
Mixed integer nonlinear programming tools: a practical overview. 4OR 9(4): 329-349 (2011) - [j53]Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci:
A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC. Comput. Networks 55(16): 3680-3693 (2011) - [j52]Mohammad Dolatabadi, Andrea Lodi, Zahra Afsharnejad:
Improving spectral bounds for clustering problems by Lagrangian relaxation. Int. Trans. Oper. Res. 18(6): 647-661 (2011) - [j51]Andrea Lodi, Silvano Martello, Michele Monaci, Claudio Cicconetti, Luciano Lenzini, Enzo Mingozzi, Carl Eklund, Jani Moilanen:
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX. Manag. Sci. 57(12): 2130-2144 (2011) - [j50]Matteo Fischetti, Andrea Lodi, Andrea Tramontani:
On the separation of disjunctive cuts. Math. Program. 128(1-2): 205-230 (2011) - [j49]Matteo Fortini, Adam N. Letchford, Andrea Lodi, Klaus Michael Wenger:
Computing compatible tours for the symmetric traveling salesman problem. Math. Program. Comput. 3(1): 59-78 (2011) - [j48]Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter:
MIPLIB 2010. Math. Program. Comput. 3(2): 103-163 (2011) - [c23]Andrea Lodi:
On Bilevel Programming and Its Impact in Branching, Cutting and Complexity. CPAIOR 2011: 3 - [c22]Andrea Lodi, Gilles Pesant, Louis-Martin Rousseau:
On Counting Lattice Points and Chvátal-Gomory Cutting Planes. CPAIOR 2011: 131-136 - 2010
- [j47]Alberto Caprara, Andrea Lodi, Michele Monaci:
An approximation scheme for the two-stage, two-dimensional knapsack problem. Discret. Optim. 7(3): 114-124 (2010) - [j46]Matteo Fischetti, Andrea Lodi:
On the knapsack closure of 0-1 Integer Linear Programs. Electron. Notes Discret. Math. 36: 799-804 (2010) - [j45]Sanjeeb Dash, Oktay Günlük, Andrea Lodi:
MIR closures of polyhedral sets. Math. Program. 121(1): 33-60 (2010) - [j44]Sanjeeb Dash, Oktay Günlük, Andrea Lodi:
Erratum to: MIR closures of polyhedral sets. Math. Program. 123(2): 485-486 (2010) - [j43]Andrea Lodi, Enrico Malaguti, Nicolás E. Stier Moses:
Efficient and fair routing for mesh networks. Math. Program. 124(1-2): 285-316 (2010) - [j42]Claudia D'Ambrosio, Andrea Lodi, Silvano Martello:
Piecewise linear approximation of functions of two variables in MILP models. Oper. Res. Lett. 38(1): 39-46 (2010) - [j41]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
On interval-subgradient and no-good cuts. Oper. Res. Lett. 38(5): 341-345 (2010) - [c21]Federico Bizzarri, Christoph Buchheim, Sergio Callegari, Alberto Caprara, Andrea Lodi, Riccardo Rovatti, Gianluca Setti:
Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program. CSDM 2010: 149-160 - [c20]Claudio Cicconetti, Luciano Lenzini, Andrea Lodi, Silvano Martello, Enzo Mingozzi, Michele Monaci:
Efficient Two-dimensional Data Allocation in IEEE 802.16 OFDMA. INFOCOM 2010: 2160-2168 - [c19]Christoph Buchheim, Alberto Caprara, Andrea Lodi:
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. IPCO 2010: 285-298 - [c18]Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey:
Experiments with Two Row Tableau Cuts. IPCO 2010: 424-437 - [c17]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. SEA 2010: 350-360 - [p3]Andrea Lodi:
Mixed Integer Programming Computation. 50 Years of Integer Programming 2010: 619-645 - [p2]Matteo Fischetti, Andrea Lodi, Domenico Salvagnin:
Just MIP it! Matheuristics 2010: 39-70 - [e2]Andrea Lodi, Michela Milano, Paolo Toth:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings. Lecture Notes in Computer Science 6140, Springer 2010 [contents]
2000 – 2009
- 2009
- [j40]Pierre Bonami, Gérard Cornuéjols, Andrea Lodi, François Margot:
A Feasibility Pump for mixed integer nonlinear programs. Math. Program. 119(2): 331-352 (2009) - [c16]Andrea Lodi, Ted K. Ralphs:
Bilevel Programming and Maximally Violated Valid Inequalities. CTW 2009: 125-134 - 2008
- [j39]Matteo Fischetti, Andrea Lodi:
Repairing MIP infeasibility through local branching. Comput. Oper. Res. 35(5): 1436-1445 (2008) - [j38]Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, François Margot, Nicolas W. Sawaya, Andreas Wächter:
An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2): 186-204 (2008) - [j37]Retsef Levi, Andrea Lodi, Maxim Sviridenko:
Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities. Math. Oper. Res. 33(2): 461-474 (2008) - [j36]Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi:
Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Program. 113(2): 241-257 (2008) - [e1]Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi:
Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings. Lecture Notes in Computer Science 5035, Springer 2008, ISBN 978-3-540-68886-0 [contents] - 2007
- [j35]Alberto Borghetti, Andrea Lodi, Silvano Martello, Michele Martignani, Carlo Alberto Nucci, Alessandro Trebbi:
An optimization problem in the electricity market. 4OR 5(3): 247-259 (2007) - [j34]Adam N. Letchford, Andrea Lodi:
The traveling salesman problem: a book review. 4OR 5(4): 315-317 (2007) - [j33]Livio Bertacco, Matteo Fischetti, Andrea Lodi:
A feasibility pump heuristic for general mixed-integer problems. Discret. Optim. 4(1): 63-76 (2007) - [j32]Matteo Fischetti, Andrea Lodi:
MIPping Closures: An Instant Survey. Graphs Comb. 23(Supplement-1): 233-243 (2007) - [j31]Matteo Fischetti, Andrea Lodi:
Optimizing over the first Chvátal closure. Math. Program. 110(1): 3-20 (2007) - [c15]Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini:
CP-Based Local Branching. CP 2007: 847-855 - [c14]Sanjeeb Dash, Oktay Günlük, Andrea Lodi:
On the MIR Closure of Polyhedra. IPCO 2007: 337-351 - [c13]Retsef Levi, Andrea Lodi, Maxim Sviridenko:
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. IPCO 2007: 454-468 - 2006
- [j30]Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci:
Packing into the smallest square: Worst-case analysis of lower bounds. Discret. Optim. 3(4): 317-326 (2006) - [j29]Andrea Lodi, Michela Milano, Louis-Martin Rousseau:
Discrepancy-Based Additive Bounding Procedures. INFORMS J. Comput. 18(4): 480-493 (2006) - [j28]Lisa Fleischer, Adam N. Letchford, Andrea Lodi:
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities. Math. Oper. Res. 31(4): 696-713 (2006) - [c12]Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth:
An MINLP Solution Method for a Water Network Problem. ESA 2006: 696-707 - 2005
- [j27]Alberto Caprara, Andrea Lodi, Michele Monaci:
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. Math. Oper. Res. 30(1): 150-172 (2005) - [j26]Matteo Fischetti, Fred W. Glover, Andrea Lodi:
The feasibility pump. Math. Program. 104(1): 91-104 (2005) - [j25]Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi:
New approaches for optimizing over the semimetric polytope. Math. Program. 104(2-3): 375-388 (2005) - [c11]Nikhil Bansal, Andrea Lodi, Maxim Sviridenko:
A Tale of Two Dimensional Bin Packing. FOCS 2005: 657-666 - [c10]Matteo Fischetti, Andrea Lodi:
Optimizing over the First Chvàtal Closure. IPCO 2005: 12-22 - 2004
- [j24]Andrea Lodi, Silvano Martello, Daniele Vigo:
TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems. Ann. Oper. Res. 131(1-4): 203-213 (2004) - [j23]Andrea Lodi, Silvano Martello, Daniele Vigo:
Models and Bounds for Two-Dimensional Level Packing Problems. J. Comb. Optim. 8(3): 363-379 (2004) - [j22]Alberto Caprara, Andrea Lodi, Romeo Rizzi:
On d-threshold graphs and d-dimensional bin packing. Networks 44(4): 266-280 (2004) - [c9]Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi:
Optimizing over Semimetric Polytopes. IPCO 2004: 431-443 - 2003
- [j21]Adam N. Letchford, Andrea Lodi:
Primal separation algorithms. 4OR 1(3): 209-224 (2003) - [j20]Andrea Lodi, Michele Monaci:
Integer linear programming models for 2-staged two-dimensional Knapsack problems. Math. Program. 94(2-3): 257-278 (2003) - [j19]Matteo Fischetti, Andrea Lodi:
Local branching. Math. Program. 98(1-3): 23-47 (2003) - [c8]Andrea Lodi, Michela Milano, Louis-Martin Rousseau:
Discrepancy-Based Additive Bounding for the AllDifferent Constraint. CP 2003: 510-524 - [p1]Filippo Focacci, François Laburthe, Andrea Lodi:
Local Search and Constraint Programming. Handbook of Metaheuristics 2003: 369-403 - 2002
- [j18]Filippo Focacci, Andrea Lodi, Michela Milano:
Embedding Relaxations in Global Constraints for Solving TSP and TSPTW. Ann. Math. Artif. Intell. 34(4): 291-311 (2002) - [j17]Filippo Focacci, Andrea Lodi, Michela Milano:
Optimization-Oriented Global Constraints. Constraints An Int. J. 7(3-4): 351-365 (2002) - [j16]Andrea Lodi, Silvano Martello, Daniele Vigo:
Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123(1-3): 379-396 (2002) - [j15]Andrea Lodi, Silvano Martello, Michele Monaci:
Two-dimensional packing problems: A survey. Eur. J. Oper. Res. 141(2): 241-252 (2002) - [j14]Andrea Lodi, Silvano Martello, Daniele Vigo:
Heuristic algorithms for the three-dimensional bin packing problem. Eur. J. Oper. Res. 141(2): 410-420 (2002) - [j13]Filippo Focacci, Andrea Lodi, Michela Milano:
Mathematical Programming Techniques in Constraint Programming: A Short Overview. J. Heuristics 8(1): 7-17 (2002) - [j12]Filippo Focacci, Andrea Lodi, Michela Milano:
A Hybrid Exact Algorithm for the TSPTW. INFORMS J. Comput. 14(4): 403-417 (2002) - [j11]Adam N. Letchford, Andrea Lodi:
Primal cutting plane algorithms revisited. Math. Methods Oper. Res. 56(1): 67-81 (2002) - [j10]Adam N. Letchford, Andrea Lodi:
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30(2): 74-82 (2002) - [j9]Andrea Lodi:
Multi-Dimensional Packing by Tabu Search. Stud. Inform. Univ. 2(1): 107-122 (2002) - [c7]Adam N. Letchford, Andrea Lodi:
Polynomial-Time Separation of Simple Comb Inequalities. IPCO 2002: 93-108 - [c6]Alberto Caprara, Andrea Lodi, Michele Monaci:
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. IPCO 2002: 315-328 - 2001
- [j8]Mauro Dell'Amico, Andrea Lodi, Silvano Martello:
Efficient algorithms and codes for k-cardinality assignment problems. Discret. Appl. Math. 110(1): 25-40 (2001) - [j7]Matteo Fischetti, Andrea Lodi, Silvano Martello, Paolo Toth:
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems. Manag. Sci. 47(6): 833-850 (2001) - [c5]Matteo Fischetti, Andrea Lodi, Paolo Toth:
Solving Real-World ATSP Instances by Branch-and-Cut. Combinatorial Optimization 2001: 64-77 - [c4]Adam N. Letchford, Andrea Lodi:
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. Combinatorial Optimization 2001: 119-133 - 2000
- [j6]Andrea Lodi, Daniele Vigo, Cinzia Zannoni:
Exact and heuristic algorithms for data sets reconstruction. Eur. J. Oper. Res. 124(1): 139-150 (2000) - [c3]Filippo Focacci, Andrea Lodi, Michela Milano:
Cutting Planes in Constraint Programming: A Hybrid Approach. CP 2000: 187-201
1990 – 1999
- 1999
- [j5]Filippo Focacci, Andrea Lodi, Michela Milano, Daniele Vigo:
Solving TSP through the Integration of OR and CP Techniques. Electron. Notes Discret. Math. 1: 13-25 (1999) - [j4]Andrea Lodi, Silvano Martello, Daniele Vigo:
Approximation algorithms for the oriented two-dimensional bin packing problem. Eur. J. Oper. Res. 112(1): 158-166 (1999) - [j3]Andrea Lodi, Kim Allemand, Thomas M. Liebling:
An evolutionary heuristic for quadratic 0-1 programming. Eur. J. Oper. Res. 119(3): 662-670 (1999) - [j2]Mauro Dell'Amico, Andrea Lodi, Francesco Maffioli:
Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method. J. Heuristics 5(2): 123-143 (1999) - [j1]Andrea Lodi, Silvano Martello, Daniele Vigo:
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems. INFORMS J. Comput. 11(4): 345-357 (1999) - [c2]Filippo Focacci, Andrea Lodi, Michela Milano:
Cost-Based Domain Filtering. CP 1999: 189-203 - [c1]Filippo Focacci, Michela Milano, Andrea Lodi:
Soving TSP with Time Windows with Constraints. ICLP 1999: 515-529
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-02 23:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
