Searching for authors named "Andrea Lodi" – sorted by Relevance.
-
A.: Repairing mip infeasibility through local branching
- Repairing MIP infeasibility through Local Branching Matteo Fischetti ∗ , Andrea Lodi ◦,† ∗ DEI
- Cited by 2 (1 self) – Add To MetaCart
-
A hybrid exact algorithm for the TSPTW
- A Hybrid Exact Algorithm for the TSPTW Filippo Focacci • Andrea Lodi • Michela Milano ILOG SA, 9
- Cited by 6 (2 self) – Add To MetaCart
-
Efficient Algorithms and Codes for k-Cardinality Assignment Problems
- @(email omitted); Andrea Lodi, Silvano Martello Dipartimento di Elettronica, Informatica e Sistemistica, Universit`a di
- Add To MetaCart
-
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- , Andrea Lodi o , Paolo Toth o Dipartimento di Elettronica e Informatica, Universit`a di Padova, Italy
- Add To MetaCart
-
A Feasibility Pump Heuristic for General Mixed-Integer Problems,’’ Discrete Optimization 4
- Fischetti ◦ , Andrea Lodi §‡ ∗ Department of Pure & Applied Mathematics, University of Padova, via Belzoni 7
- Cited by 6 (0 self) – Add To MetaCart
-
The feasibility pump
- The feasibility pump Matteo Fischetti ∗ , Fred Glover + , Andrea Lodi ◦ ∗ DEI, University
- Cited by 10 (4 self) – Add To MetaCart
-
Local Search and Constraint Programming
- Filippo Focacci ∗ François Laburthe † Andrea Lodi ‡ ∗ ILOG S.A. 9, rue de Verdun - BP 85, 94253 Gentilly
- Cited by 16 (0 self) – Add To MetaCart
-
Primal Separation Algorithms
- Primal Separation Algorithms Adam N. Letchford # & Andrea Lodi # # Department of Management
- Cited by 5 (2 self) – Add To MetaCart
-
Polynomial-Time Separation of Simple Comb Inequalities
- Polynomial-Time Separation of Simple Comb Inequalities Adam N. Letchford & Andrea Lodi
- Cited by 5 (3 self) – Add To MetaCart
-
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming Adam N. Letchford 1 and Andrea
- Cited by 1 (0 self) – Add To MetaCart

