| 2008 |
|---|
| 48 | | 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 |
| 47 | EE | Matteo Fischetti,
Andrea Lodi:
Repairing MIP infeasibility through local branching.
Computers & OR 35(5): 1436-1445 (2008) |
| 46 | EE | 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 |
|---|
| 45 | EE | Zeynep Kiziltan,
Andrea Lodi,
Michela Milano,
Fabio Parisini:
CP-Based Local Branching.
CP 2007: 847-855 |
| 44 | EE | Fabio Campi,
Antonio Deledda,
Matteo Pizzotti,
Luca Ciccarelli,
Pier Luigi Rolandi,
Claudio Mucci,
Andrea Lodi,
Arseni Vitkovski,
Luca Vanzolini:
A dynamically adaptive DSP for heterogeneous reconfigurable platforms.
DATE 2007: 9-14 |
| 43 | EE | Sanjeeb Dash,
Oktay Günlük,
Andrea Lodi:
On the MIR Closure of Polyhedra.
IPCO 2007: 337-351 |
| 42 | EE | Retsef Levi,
Andrea Lodi,
Maxim Sviridenko:
Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.
IPCO 2007: 454-468 |
| 41 | EE | 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) |
| 40 | EE | Adam N. Letchford,
Andrea Lodi:
The traveling salesman problem: a book review.
4OR 5(4): 315-317 (2007) |
| 39 | EE | Matteo Fischetti,
Andrea Lodi:
Optimizing over the first Chvátal closure.
Math. Program. 110(1): 3-20 (2007) |
| 2006 |
|---|
| 38 | EE | Cristiana Bragalli,
Claudia D'Ambrosio,
Jon Lee,
Andrea Lodi,
Paolo Toth:
An MINLP Solution Method for a Water Network Problem.
ESA 2006: 696-707 |
| 37 | EE | Andrea Lodi,
Claudio Mucci,
Massimo Bocchi,
Andrea Cappelli,
Mario de Dominicis,
Luca Ciccarelli:
A Multi-Context Pipelined Array for Embedded Systems.
FPL 2006: 1-8 |
| 2005 |
|---|
| 36 | EE | Andrea Lodi,
Luca Ciccarelli,
Claudio Mucci,
Roberto Giansante,
Andrea Cappelli,
Mario Toma:
An Embedded Reconfigurable Datapath for SoC.
FCCM 2005: 303-304 |
| 35 | EE | Nikhil Bansal,
Andrea Lodi,
Maxim Sviridenko:
A Tale of Two Dimensional Bin Packing.
FOCS 2005: 657-666 |
| 34 | EE | Andrea Lodi,
Luca Ciccarelli,
Roberto Giansante:
Combining low-leakage techniques for FPGA routing design.
FPGA 2005: 208-214 |
| 33 | EE | Matteo Fischetti,
Andrea Lodi:
Optimizing over the First Chvàtal Closure.
IPCO 2005: 12-22 |
| 32 | EE | Matteo Fischetti,
Fred Glover,
Andrea Lodi:
The feasibility pump.
Math. Program. 104(1): 91-104 (2005) |
| 31 | EE | Antonio Frangioni,
Andrea Lodi,
Giovanni Rinaldi:
New approaches for optimizing over the semimetric polytope.
Math. Program. 104(2-3): 375-388 (2005) |
| 2004 |
|---|
| 30 | EE | Andrea Cappelli,
Andrea Lodi,
Claudio Mucci,
Mario Toma,
Fabio Campi:
A Dataflow Control Unit for C-to-Configurable Pipelines Compilation Flow.
FCCM 2004: 332-333 |
| 29 | EE | Andrea Lodi,
Roberto Giansante,
Carlo Chiesa,
Luca Ciccarelli,
Mario Toma,
Fabio Campi:
Routing architecture for multi-context FPGAs.
FPGA 2004: 246 |
| 28 | EE | Andrea Lodi,
Roberto Giansante,
Carlo Chiesa,
Luca Ciccarelli,
Fabio Campi,
Mario Toma:
Compact Buffered Routing Architecture.
FPL 2004: 179-188 |
| 27 | EE | Antonio Frangioni,
Andrea Lodi,
Giovanni Rinaldi:
Optimizing over Semimetric Polytopes.
IPCO 2004: 431-443 |
| 26 | EE | Andrea Lodi,
Silvano Martello,
Daniele Vigo:
Models and Bounds for Two-Dimensional Level Packing Problems.
J. Comb. Optim. 8(3): 363-379 (2004) |
| 25 | EE | Alberto Caprara,
Andrea Lodi,
Romeo Rizzi:
On d-threshold graphs and d-dimensional bin packing.
Networks 44(4): 266-280 (2004) |
| 2003 |
|---|
| 24 | EE | Andrea Lodi,
Michela Milano,
Louis-Martin Rousseau:
Discrepancy-Based Additive Bounding for the AllDifferent Constraint.
CP 2003: 510-524 |
| 23 | EE | Andrea Lodi,
Mario Toma,
Fabio Campi:
A pipelined configurable gate array for embedded processors.
FPGA 2003: 21-30 |
| 22 | EE | Fabio Campi,
Andrea Cappelli,
Roberto Guerrieri,
Andrea Lodi,
Mario Toma,
Alberto La Rosa,
Luciano Lavagno,
Claudio Passerone,
Roberto Canegallo:
A Reconfigurable Processor Architecture and Software Development Environment for Embedded Systems.
IPDPS 2003: 171 |
| 21 | EE | Andrea Lodi,
Carlo Chiesa,
Fabio Campi,
Mario Toma:
A flexible LUT-based carry chain for FPGAs.
ISCAS (5) 2003: 133-136 |
| 20 | EE | Andrea Lodi,
Luca Ciccarelli,
Andrea Cappelli,
Fabio Campi,
Mario Toma:
Decoder-Based Multi-Context Interconnect Architecture.
ISVLSI 2003: 231-233 |
| 19 | EE | Adam N. Letchford,
Andrea Lodi:
Primal separation algorithms.
4OR 1(3): 209-224 (2003) |
| 2002 |
|---|
| 18 | EE | Alberto Caprara,
Andrea Lodi,
Michele Monaci:
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.
IPCO 2002: 315-328 |
| 17 | EE | Adam N. Letchford,
Andrea Lodi:
Polynomial-Time Separation of Simple Comb Inequalities.
IPCO 2002: 93-108 |
| 16 | | 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) |
| 15 | | Filippo Focacci,
Andrea Lodi,
Michela Milano:
Optimization-Oriented Global Constraints.
Constraints 7(3-4): 351-365 (2002) |
| 14 | | Andrea Lodi,
Silvano Martello,
Daniele Vigo:
Recent advances on two-dimensional bin packing problems.
Discrete Applied Mathematics 123(1-3): 379-396 (2002) |
| 13 | EE | Andrea Lodi,
Silvano Martello,
Michele Monaci:
Two-dimensional packing problems: A survey.
European Journal of Operational Research 141(2): 241-252 (2002) |
| 12 | EE | 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) |
| 11 | EE | Filippo Focacci,
Andrea Lodi,
Michela Milano:
A Hybrid Exact Algorithm for the TSPTW.
INFORMS Journal on Computing 14(4): 403-417 (2002) |
| 10 | | Filippo Focacci,
Andrea Lodi,
Michela Milano:
Mathematical Programming Techniques in Constraint Programming: A Short Overview.
J. Heuristics 8(1): 7-17 (2002) |
| 9 | EE | Adam N. Letchford,
Andrea Lodi:
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts.
Oper. Res. Lett. 30(2): 74-82 (2002) |
| 8 | EE | Andrea Lodi:
Multi-Dimensional Packing by Tabu Search.
Stud. Inform. Univ. 2(1): 107-122 (2002) |
| 2001 |
|---|
| 7 | EE | Adam N. Letchford,
Andrea Lodi:
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.
Combinatorial Optimization 2001: 119-133 |
| 6 | EE | Matteo Fischetti,
Andrea Lodi,
Paolo Toth:
Solving Real-World ATSP Instances by Branch-and-Cut.
Combinatorial Optimization 2001: 64-77 |
| 5 | | 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 |
|---|
| 4 | EE | Filippo Focacci,
Andrea Lodi,
Michela Milano:
Cutting Planes in Constraint Programming: A Hybrid Approach.
CP 2000: 187-201 |
| 1999 |
|---|
| 3 | | Filippo Focacci,
Andrea Lodi,
Michela Milano:
Cost-Based Domain Filtering.
CP 1999: 189-203 |
| 2 | | Filippo Focacci,
Michela Milano,
Andrea Lodi:
Soving TSP with Time Windows with Constraints.
ICLP 1999: 515-529 |
| 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) |
