Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andrea Lodi
Author information
- DEIS, University of Bologna
Other persons with the same name
2010 – today
- 2013
[j58]Claudia D'Ambrosio, Andrea Lodi: Mixed integer nonlinear programming tools: an updated practical overview. Annals OR 204(1): 301-320 (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
- 2012
- [j57]Mohammad Dolatabadi, Andrea Lodi, Michele Monaci: Exact algorithms for the two-dimensional guillotine knapsack. Computers & OR 39(1): 48-53 (2012)
- [j56]Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini: Bounding, filtering and diversification in CP-based local branching. J. Heuristics 18(3): 353-374 (2012)
- [j55]Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani: A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. INFORMS Journal on Computing 24(1): 132-147 (2012)
- [j54]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)
- [j53]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi: A storm of feasibility pumps for nonconvex MINLP. Math. Program. 136(2): 375-402 (2012)
- [j52]Cor A. J. Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger: Complexity and approximation of an area packing problem. Optimization Letters 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
- [j51]Claudia D'Ambrosio, Andrea Lodi: Mixed integer nonlinear programming tools: a practical overview. 4OR 9(4): 329-349 (2011)
- [j50]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. Computer Networks 55(16): 3680-3693 (2011)
- [j49]Andrea Lodi, Silvano Martello, Michele Monaci, Claudio Cicconetti, Luciano Lenzini, Enzo Mingozzi, Carl Eklund, Jani Moilanen: Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX. Management Science 57(12): 2130-2144 (2011)
- [j48]Matteo Fischetti, Andrea Lodi, Andrea Tramontani: On the separation of disjunctive cuts. Math. Program. 128(1-2): 205-230 (2011)
- [j47]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)
- [j46]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
- [j45]Alberto Caprara, Andrea Lodi, Michele Monaci: An approximation scheme for the two-stage, two-dimensional knapsack problem. Discrete Optimization 7(3): 114-124 (2010)
- [j44]Matteo Fischetti, Andrea Lodi: On the knapsack closure of 0-1 Integer Linear Programs. Electronic Notes in Discrete Mathematics 36: 799-804 (2010)
- [j43]Sanjeeb Dash, Oktay Günlük, Andrea Lodi: MIR closures of polyhedral sets. Math. Program. 121(1): 33-60 (2010)
- [j42]Sanjeeb Dash, Oktay Günlük, Andrea Lodi: Erratum to: MIR closures of polyhedral sets. Math. Program. 123(2): 485-486 (2010)
- [j41]Andrea Lodi, Enrico Malaguti, Nicolás E. Stier Moses: Efficient and fair routing for mesh networks. Math. Program. 124(1-2): 285-316 (2010)
- [j40]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)
- [j39]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
- [p1]
- [e2]Andrea Lodi, Michela Milano, Paolo Toth (Eds.): 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
2000 – 2009
- 2009
- [j38]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
- [j37]Matteo Fischetti, Andrea Lodi: Repairing MIP infeasibility through local branching. Computers & OR 35(5): 1436-1445 (2008)
- [j36]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. Discrete Optimization 5(2): 186-204 (2008)
- [j35]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)
- [j34]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 (Eds.): 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
- 2007
- [j33]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)
- [j32]Adam N. Letchford, Andrea Lodi: The traveling salesman problem: a book review. 4OR 5(4): 315-317 (2007)
- [j31]Livio Bertacco, Matteo Fischetti, Andrea Lodi: A feasibility pump heuristic for general mixed-integer problems. Discrete Optimization 4(1): 63-76 (2007)
- [j30]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]
- [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
- [j29]Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci: Packing into the smallest square: Worst-case analysis of lower bounds. Discrete Optimization 3(4): 317-326 (2006)
- [j28]Andrea Lodi, Michela Milano, Louis-Martin Rousseau: Discrepancy-Based Additive Bounding Procedures. INFORMS Journal on Computing 18(4): 480-493 (2006)
- [j27]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
- [j26]Alberto Caprara, Andrea Lodi, Michele Monaci: Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. Math. Oper. Res. 30(1): 150-172 (2005)
- [j25]Matteo Fischetti, Fred Glover, Andrea Lodi: The feasibility pump. Math. Program. 104(1): 91-104 (2005)
- [j24]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]
- 2004
- [j23]Andrea Lodi, Silvano Martello, Daniele Vigo: TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems. Annals OR 131(1-4): 203-213 (2004)
- [j22]Andrea Lodi, Silvano Martello, Daniele Vigo: Models and Bounds for Two-Dimensional Level Packing Problems. J. Comb. Optim. 8(3): 363-379 (2004)
- [j21]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
- [j20]
- [j19]Andrea Lodi, Michele Monaci: Integer linear programming models for 2-staged two-dimensional Knapsack problems. Math. Program. 94(2-3): 257-278 (2003)
- [j18]
- [c8]Andrea Lodi, Michela Milano, Louis-Martin Rousseau: Discrepancy-Based Additive Bounding for the AllDifferent Constraint. CP 2003: 510-524
- 2002
- [j17]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)
- [j16]Filippo Focacci, Andrea Lodi, Michela Milano: Optimization-Oriented Global Constraints. Constraints 7(3-4): 351-365 (2002)
- [j15]Andrea Lodi, Silvano Martello, Daniele Vigo: Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123(1-3): 379-396 (2002)
- [j14]Andrea Lodi, Silvano Martello, Michele Monaci: Two-dimensional packing problems: A survey. European Journal of Operational Research 141(2): 241-252 (2002)
- [j13]Andrea Lodi, Silvano Martello, Daniele Vigo: Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research 141(2): 410-420 (2002)
- [j12]Filippo Focacci, Andrea Lodi, Michela Milano: Mathematical Programming Techniques in Constraint Programming: A Short Overview. J. Heuristics 8(1): 7-17 (2002)
- [j11]Filippo Focacci, Andrea Lodi, Michela Milano: A Hybrid Exact Algorithm for the TSPTW. INFORMS Journal on Computing 14(4): 403-417 (2002)
- [j10]Adam N. Letchford, Andrea Lodi: Primal cutting plane algorithms revisited. Math. Meth. of OR 56(1): 67-81 (2002)
- [j9]Adam N. Letchford, Andrea Lodi: Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30(2): 74-82 (2002)
- [j8]
- [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
- [j7]Mauro Dell'Amico, Andrea Lodi, Silvano Martello: Efficient algorithms and codes for k-cardinality assignment problems. Discrete Applied Mathematics 110(1): 25-40 (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. European Journal of Operational Research 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. Electronic Notes in Discrete Mathematics 1: 13-25 (1999)
- [j4]Andrea Lodi, Silvano Martello, Daniele Vigo: Approximation algorithms for the oriented two-dimensional bin packing problem. European Journal of Operational Research 112(1): 158-166 (1999)
- [j3]Andrea Lodi, Kim Allemand, Thomas M. Liebling: An evolutionary heuristic for quadratic 0-1 programming. European Journal of Operational Research 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 Journal on Computing 11(4): 345-357 (1999)
- [c2]
- [c1]Filippo Focacci, Michela Milano, Andrea Lodi: Soving TSP with Time Windows with Constraints. ICLP 1999: 515-529
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-21 22:07 CEST by the dblp team