DEIS, University of Bologna
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
| 2009 | ||
|---|---|---|
| 48 | Andrea Lodi, Ted K. Ralphs: Bilevel Programming and Maximally Violated Valid Inequalities. CTW 2009: 125-134 | |
| 2008 | ||
| 47 | Andrea Lodi, Alessandro Panconesi, Giovanni Rinaldi: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings Springer 2008 | |
| 46 | Matteo Fischetti, Andrea Lodi: Repairing MIP infeasibility through local branching. Computers & OR 35(5): 1436-1445 (2008) | |
| 45 | 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) | |
| 44 | 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) | |
| 43 | 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) | |
| 2007 | ||
| 42 | Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini: CP-Based Local Branching. CP 2007: 847-855 | |
| 41 | Sanjeeb Dash, Oktay Günlük, Andrea Lodi: On the MIR Closure of Polyhedra. IPCO 2007: 337-351 | |
| 40 | Retsef Levi, Andrea Lodi, Maxim Sviridenko: Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. IPCO 2007: 454-468 | |
| 39 | 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) | |
| 38 | Adam N. Letchford, Andrea Lodi: The traveling salesman problem: a book review. 4OR 5(4): 315-317 (2007) | |
| 37 | Livio Bertacco, Matteo Fischetti, Andrea Lodi: A feasibility pump heuristic for general mixed-integer problems. Discrete Optimization 4(1): 63-76 (2007) | |
| 36 | Matteo Fischetti, Andrea Lodi: Optimizing over the first Chvátal closure. Math. Program. 110(1): 3-20 (2007) | |
| 2006 | ||
| 35 | Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth: An MINLP Solution Method for a Water Network Problem. ESA 2006: 696-707 | |
| 34 | 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) | |
| 33 | Andrea Lodi, Michela Milano, Louis-Martin Rousseau: Discrepancy-Based Additive Bounding Procedures. INFORMS Journal on Computing 18(4): 480-493 (2006) | |
| 32 | 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) | |
| 2005 | ||
| 31 | Nikhil Bansal, Andrea Lodi, Maxim Sviridenko: A Tale of Two Dimensional Bin Packing. FOCS 2005: 657-666 | |
| 30 | Matteo Fischetti, Andrea Lodi: Optimizing over the First Chvàtal Closure. IPCO 2005: 12-22 | |
| 29 | Alberto Caprara, Andrea Lodi, Michele Monaci: Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. Math. Oper. Res. 30(1): 150-172 (2005) | |
| 28 | Matteo Fischetti, Fred Glover, Andrea Lodi: The feasibility pump. Math. Program. 104(1): 91-104 (2005) | |
| 27 | Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi: New approaches for optimizing over the semimetric polytope. Math. Program. 104(2-3): 375-388 (2005) | |
| 2004 | ||
| 26 | Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi: Optimizing over Semimetric Polytopes. IPCO 2004: 431-443 | |
| 25 | 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) | |
| 24 | Andrea Lodi, Silvano Martello, Daniele Vigo: Models and Bounds for Two-Dimensional Level Packing Problems. J. Comb. Optim. 8(3): 363-379 (2004) | |
| 23 | Alberto Caprara, Andrea Lodi, Romeo Rizzi: On d-threshold graphs and d-dimensional bin packing. Networks 44(4): 266-280 (2004) | |
| 2003 | ||
| 22 | Andrea Lodi, Michela Milano, Louis-Martin Rousseau: Discrepancy-Based Additive Bounding for the AllDifferent Constraint. CP 2003: 510-524 | |
| 21 | Adam N. Letchford, Andrea Lodi: Primal separation algorithms. 4OR 1(3): 209-224 (2003) | |
| 2002 | ||
| 20 | Alberto Caprara, Andrea Lodi, Michele Monaci: An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. IPCO 2002: 315-328 | |
| 19 | Adam N. Letchford, Andrea Lodi: Polynomial-Time Separation of Simple Comb Inequalities. IPCO 2002: 93-108 | |
| 18 | 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) | |
| 17 | Filippo Focacci, Andrea Lodi, Michela Milano: Optimization-Oriented Global Constraints. Constraints 7(3-4): 351-365 (2002) | |
| 16 | Andrea Lodi, Silvano Martello, Daniele Vigo: Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123(1-3): 379-396 (2002) | |
| 15 | Andrea Lodi, Silvano Martello, Michele Monaci: Two-dimensional packing problems: A survey. European Journal of Operational Research 141(2): 241-252 (2002) | |
| 14 | 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) | |
| 13 | Filippo Focacci, Andrea Lodi, Michela Milano: A Hybrid Exact Algorithm for the TSPTW. INFORMS Journal on Computing 14(4): 403-417 (2002) | |
| 12 | Filippo Focacci, Andrea Lodi, Michela Milano: Mathematical Programming Techniques in Constraint Programming: A Short Overview. J. Heuristics 8(1): 7-17 (2002) | |
| 11 | Adam N. Letchford, Andrea Lodi: Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30(2): 74-82 (2002) | |
| 10 | Andrea Lodi: Multi-Dimensional Packing by Tabu Search. Stud. Inform. Univ. 2(1): 107-122 (2002) | |
| 2001 | ||
| 9 | Adam N. Letchford, Andrea Lodi: An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. Combinatorial Optimization 2001: 119-133 | |
| 8 | Matteo Fischetti, Andrea Lodi, Paolo Toth: Solving Real-World ATSP Instances by Branch-and-Cut. Combinatorial Optimization 2001: 64-77 | |
| 7 | Mauro Dell'Amico, Andrea Lodi, Silvano Martello: Efficient algorithms and codes for k-cardinality assignment problems. Discrete Applied Mathematics 110(1): 25-40 (2001) | |
| 2000 | ||
| 6 | Filippo Focacci, Andrea Lodi, Michela Milano: Cutting Planes in Constraint Programming: A Hybrid Approach. CP 2000: 187-201 | |
| 1999 | ||
| 5 | Filippo Focacci, Andrea Lodi, Michela Milano: Cost-Based Domain Filtering. CP 1999: 189-203 | |
| 4 | Filippo Focacci, Michela Milano, Andrea Lodi: Soving TSP with Time Windows with Constraints. ICLP 1999: 515-529 | |
| 3 | 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) | |
| 2 | 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) | |
| 1 | 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) | |