The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrea Lodi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Matteo Fischetti, Andrea Lodi, Paolo Toth
    Solving Real-World ATSP Instances by Branch-and-Cut. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:64-77 [Conf]
  2. Adam N. Letchford, Andrea Lodi
    An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:119-133 [Conf]
  3. Filippo Focacci, Andrea Lodi, Michela Milano
    Cutting Planes in Constraint Programming: A Hybrid Approach. [Citation Graph (0, 0)][DBLP]
    CP, 2000, pp:187-201 [Conf]
  4. Filippo Focacci, Andrea Lodi, Michela Milano
    Cost-Based Domain Filtering. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:189-203 [Conf]
  5. Andrea Lodi, Michela Milano, Louis-Martin Rousseau
    Discrepancy-Based Additive Bounding for the AllDifferent Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:510-524 [Conf]
  6. Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth
    An MINLP Solution Method for a Water Network Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:696-707 [Conf]
  7. Nikhil Bansal, Andrea Lodi, Maxim Sviridenko
    A Tale of Two Dimensional Bin Packing. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:657-666 [Conf]
  8. Filippo Focacci, Michela Milano, Andrea Lodi
    Soving TSP with Time Windows with Constraints. [Citation Graph (0, 0)][DBLP]
    ICLP, 1999, pp:515-529 [Conf]
  9. Matteo Fischetti, Andrea Lodi
    Optimizing over the First Chvàtal Closure. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:12-22 [Conf]
  10. Alberto Caprara, Andrea Lodi, Michele Monaci
    An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:315-328 [Conf]
  11. Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi
    Optimizing over Semimetric Polytopes. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:431-443 [Conf]
  12. Adam N. Letchford, Andrea Lodi
    Polynomial-Time Separation of Simple Comb Inequalities. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:93-108 [Conf]
  13. Adam N. Letchford, Andrea Lodi
    Primal separation algorithms. [Citation Graph (0, 0)][DBLP]
    4OR, 2003, v:1, n:3, pp:209-224 [Journal]
  14. Filippo Focacci, Andrea Lodi, Michela Milano
    Embedding Relaxations in Global Constraints for Solving TSP and TSPTW. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2002, v:34, n:4, pp:291-311 [Journal]
  15. Filippo Focacci, Andrea Lodi, Michela Milano
    Optimization-Oriented Global Constraints. [Citation Graph (0, 0)][DBLP]
    Constraints, 2002, v:7, n:3-4, pp:351-365 [Journal]
  16. Mauro Dell'Amico, Andrea Lodi, Silvano Martello
    Efficient algorithms and codes for k-cardinality assignment problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:1, pp:25-40 [Journal]
  17. Andrea Lodi, Silvano Martello, Daniele Vigo
    Recent advances on two-dimensional bin packing problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:379-396 [Journal]
  18. Filippo Focacci, Andrea Lodi, Michela Milano
    Mathematical Programming Techniques in Constraint Programming: A Short Overview. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2002, v:8, n:1, pp:7-17 [Journal]
  19. Mauro Dell'Amico, Andrea Lodi, Francesco Maffioli
    Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 1999, v:5, n:2, pp:123-143 [Journal]
  20. Filippo Focacci, Andrea Lodi, Michela Milano
    A Hybrid Exact Algorithm for the TSPTW. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2002, v:14, n:4, pp:403-417 [Journal]
  21. Andrea Lodi, Silvano Martello, Daniele Vigo
    Models and Bounds for Two-Dimensional Level Packing Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:3, pp:363-379 [Journal]
  22. Matteo Fischetti, Fred Glover, Andrea Lodi
    The feasibility pump. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:104, n:1, pp:91-104 [Journal]
  23. Antonio Frangioni, Andrea Lodi, Giovanni Rinaldi
    New approaches for optimizing over the semimetric polytope. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:104, n:2-3, pp:375-388 [Journal]
  24. Matteo Fischetti, Andrea Lodi
    Optimizing over the first Chvátal closure. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:3-20 [Journal]
  25. Alberto Caprara, Andrea Lodi, Romeo Rizzi
    On d-threshold graphs and d-dimensional bin packing. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:4, pp:266-280 [Journal]
  26. Adam N. Letchford, Andrea Lodi
    Strengthening Chvátal-Gomory cuts and Gomory fractional cuts. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:2, pp:74-82 [Journal]
  27. Andrea Lodi
    Multi-Dimensional Packing by Tabu Search. [Citation Graph (0, 0)][DBLP]
    Stud. Inform. Univ., 2002, v:2, n:1, pp:107-122 [Journal]
  28. Andrea Lodi, Silvano Martello, Michele Monaci
    Two-dimensional packing problems: A survey. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:241-252 [Journal]
  29. Andrea Lodi, Silvano Martello, Daniele Vigo
    Heuristic algorithms for the three-dimensional bin packing problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:410-420 [Journal]
  30. Zeynep Kiziltan, Andrea Lodi, Michela Milano, Fabio Parisini
    CP-Based Local Branching. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:847-855 [Conf]
  31. Sanjeeb Dash, Oktay Günlük, Andrea Lodi
    On the MIR Closure of Polyhedra. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:337-351 [Conf]
  32. Retsef Levi, Andrea Lodi, Maxim Sviridenko
    Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:454-468 [Conf]

  33. Efficient Two-dimensional Data Allocation in IEEE 802.16 OFDMA. [Citation Graph (, )][DBLP]


  34. An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. [Citation Graph (, )][DBLP]


  35. Experiments with Two Row Tableau Cuts. [Citation Graph (, )][DBLP]


  36. Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. [Citation Graph (, )][DBLP]


  37. Bilevel Programming and Maximally Violated Valid Inequalities. [Citation Graph (, )][DBLP]


  38. An optimization problem in the electricity market. [Citation Graph (, )][DBLP]


  39. The traveling salesman problem: a book review. [Citation Graph (, )][DBLP]


  40. Repairing MIP infeasibility through local branching. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002