Sfoglia per Autore
Solution of the cumulative assignment problem with a well-structured Tabu Search method
1999 Dell'Amico M.; Lodi A.; Maffioli F.
Cost-based domain filtering
1999 Focacci F.; Lodi A.; Milano M.
Evolutionary heuristic for quadratic 0-1 programming
1999 Lodi A.; Allemand K.; Liebling T.M.
Cutting planes in constraint programming: An hybrid approach
2000 Focacci F.; Lodi A.; Milano M.
Efficient algorithms and codes for k-cardinality assignment problems
2001 Dell'Amico M.; Lodi A.; Martello S.
A polyhedral approach to simplified crew scheduling and vehicle scheduling problems
2001 Fischetti M.; Lodi A.; Martello S.; Toth P.
Preface
2002 Focacci F.; Lodi A.; Milano M.; Vigo D.
An approximation scheme for the two-stage, two-dimensional bin packing problem
2002 Caprara A.; Lodi A.; Monaci M.
Heuristic algorithms for the three-dimensional bin packing problem
2002 Lodi A.; Martello S.; Vigo D.
Two-dimensional packing problems: A survey
2002 Lodi A.; Martello S.; Monaci M.
Primal cutting plane algorithms revisited
2002 Letchford A.N.; Lodi A.
Optimization-oriented global constraints
2002 Focacci F.; Lodi A.; Milano M.
Polynomial-time separation of simple comb inequalities
2002 Letchford A.N.; Lodi A.
Mathematical programming techniques in constraint programming: A short overview
2002 Focacci F.; Lodi A.; Milano M.
Recent advances on two-dimensional bin packing problems
2002 Lodi A.; Martello S.; Vigo D.
Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
2002 Letchford A.N.; Lodi A.
Embedding relaxations in global constraints for solving TSP and TSPTW
2002 Focacci F.; Lodi A.; Milano M.
Solving real-world ATSP instances by branch-and-cut
2003 Fischetti M.; Lodi A.; Toth P.
Discrepancy-based additive bounding for the AllDifferent constraint
2003 Lodi A.; Milano M.; Rousseau L.-M.
Primal separation algorithms
2003 Letchford A.N.; Lodi A.
| Titolo | Autore(i) | Anno | Periodico | Editore | Tipo | File |
|---|---|---|---|---|---|---|
| Solution of the cumulative assignment problem with a well-structured Tabu Search method | Dell'Amico M.; Lodi A.; Maffioli F. | 1999-01-01 | JOURNAL OF HEURISTICS | - | 1.01 Articolo in rivista | - |
| Cost-based domain filtering | Focacci F.; Lodi A.; Milano M. | 1999-01-01 | - | - | 4.01 Contributo in Atti di convegno | - |
| Evolutionary heuristic for quadratic 0-1 programming | Lodi A.; Allemand K.; Liebling T.M. | 1999-01-01 | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - | 1.01 Articolo in rivista | - |
| Cutting planes in constraint programming: An hybrid approach | Focacci F.; Lodi A.; Milano M. | 2000-01-01 | - | - | 4.01 Contributo in Atti di convegno | - |
| Efficient algorithms and codes for k-cardinality assignment problems | Dell'Amico M.; Lodi A.; Martello S. | 2001-01-01 | DISCRETE APPLIED MATHEMATICS | - | 1.01 Articolo in rivista | - |
| A polyhedral approach to simplified crew scheduling and vehicle scheduling problems | Fischetti M.; Lodi A.; Martello S.; Toth P. | 2001-01-01 | MANAGEMENT SCIENCE | - | 1.01 Articolo in rivista | - |
| Preface | Focacci F.; Lodi A.; Milano M.; Vigo D. | 2002-01-01 | JOURNAL OF HEURISTICS | - | 1.04 Replica / breve intervento (e simili) | - |
| An approximation scheme for the two-stage, two-dimensional bin packing problem | Caprara A.; Lodi A.; Monaci M. | 2002-01-01 | MATHEMATICS OF OPERATIONS RESEARCH | - | 1.01 Articolo in rivista | - |
| Heuristic algorithms for the three-dimensional bin packing problem | Lodi A.; Martello S.; Vigo D. | 2002-01-01 | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - | 1.01 Articolo in rivista | - |
| Two-dimensional packing problems: A survey | Lodi A.; Martello S.; Monaci M. | 2002-01-01 | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - | 1.01 Articolo in rivista | - |
| Primal cutting plane algorithms revisited | Letchford A.N.; Lodi A. | 2002-01-01 | MATHEMATICAL METHODS OF OPERATIONS RESEARCH | - | 1.01 Articolo in rivista | - |
| Optimization-oriented global constraints | Focacci F.; Lodi A.; Milano M. | 2002-01-01 | CONSTRAINTS | - | 1.01 Articolo in rivista | - |
| Polynomial-time separation of simple comb inequalities | Letchford A.N.; Lodi A. | 2002-01-01 | - | - | 4.01 Contributo in Atti di convegno | - |
| Mathematical programming techniques in constraint programming: A short overview | Focacci F.; Lodi A.; Milano M. | 2002-01-01 | JOURNAL OF HEURISTICS | - | 1.01 Articolo in rivista | - |
| Recent advances on two-dimensional bin packing problems | Lodi A.; Martello S.; Vigo D. | 2002-01-01 | DISCRETE APPLIED MATHEMATICS | - | 1.01 Articolo in rivista | - |
| Strengthening Chvátal-Gomory cuts and Gomory fractional cuts | Letchford A.N.; Lodi A. | 2002-01-01 | OPERATIONS RESEARCH LETTERS | - | 1.01 Articolo in rivista | - |
| Embedding relaxations in global constraints for solving TSP and TSPTW | Focacci F.; Lodi A.; Milano M. | 2002-01-01 | ANNALS OF MATHEMATICS AND OF ARTIFICIAL INTELLIGENCE | - | 1.01 Articolo in rivista | - |
| Solving real-world ATSP instances by branch-and-cut | Fischetti M.; Lodi A.; Toth P. | 2003-01-01 | - | - | 4.01 Contributo in Atti di convegno | - |
| Discrepancy-based additive bounding for the AllDifferent constraint | Lodi A.; Milano M.; Rousseau L.-M. | 2003-01-01 | - | - | 4.01 Contributo in Atti di convegno | - |
| Primal separation algorithms | Letchford A.N.; Lodi A. | 2003-01-01 | 4OR | - | 1.01 Articolo in rivista | - |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile