Andrea Lodi

According to our database1, Andrea Lodi authored at least 126 papers between 1999 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Exact Solutions for the Carrier-Vehicle Traveling Salesman Problem.
Transportation Science, 2018

A polynomial algorithm for a continuous bilevel knapsack problem.
Oper. Res. Lett., 2018

Experiments on virtual private network design with concave capacity costs.
Optimization Letters, 2018

Predicting Solution Summaries to Integer Linear Programs under Imperfect Information with Machine Learning.
CoRR, 2018

Learning to rank for censored survival data.
CoRR, 2018

A Comparison of Optimization Methods for Multi-objective Constrained Bin Packing Problems.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Learning a Classification of Mixed-Integer Quadratic Programming Problems.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017
Integral simplex using decomposition with primal cutting planes.
Math. Program., 2017

Nash equilibria in the two-player kidney exchange game.
Math. Program., 2017

Special issue on: Nonlinear and combinatorial methods for energy optimization.
EURO J. Computational Optimization, 2017

Partial enumeration algorithms for Two-Dimensional Bin Packing Problem with guillotine constraints.
Discrete Applied Mathematics, 2017

An ILP Solver for Multi-label MRFS with Connectivity Constraints.
CoRR, 2017

Deep Learning for Patient-Specific Kidney Graft Survival Analysis.
CoRR, 2017

Cutting Planes from Wide Split Disjunctions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Improving branch-and-cut performance by random sampling.
Math. Program. Comput., 2016

Single-commodity robust network design with finite and Hose demand sets.
Math. Program., 2016

Design and Control of Public-Service Contracts and an Application to Public Transportation Systems.
Management Science, 2016

Bilevel Knapsack with Interdiction Constraints.
INFORMS Journal on Computing, 2016

Preface.
Discrete Optimization, 2016

On handling indicator constraints in mixed integer programming.
Comp. Opt. and Appl., 2016

2015
Virtual private network design over the first Chvátal closure.
RAIRO - Operations Research, 2015

On mathematical programming with indicator constraints.
Math. Program., 2015

Erratum to "Mathematical programming techniques in water network optimization" [Eur. J. Oper. Res. 243(2015) 774-788].
European Journal of Operational Research, 2015

Mathematical programming techniques in water network optimization.
European Journal of Operational Research, 2015

Scheduling M2M traffic over LTE uplink of a dense small cells network.
Proceedings of the 2015 International Symposium on Wireless Communication Systems (ISWCS), 2015

2014
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics.
IEEE Trans. Signal Processing, 2014

Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA.
IEEE/ACM Trans. Netw., 2014

A Study on the Computational Complexity of the Bilevel Knapsack Problem.
SIAM Journal on Optimization, 2014

On the difficulty of virtual private network instances.
Networks, 2014

Bilevel programming and the separation problem.
Math. Program., 2014

On the Practical Strength of Two-Row Tableau Cuts.
INFORMS Journal on Computing, 2014

Optimistic MILP modeling of non-linear optimization problems.
European Journal of Operational Research, 2014

Single-commodity robust network design problem: Complexity, instances and heuristic solutions.
European Journal of Operational Research, 2014

Integral Simplex Using Decomposition with Primal Cuts.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Optimum: Thermal-aware task allocation for heterogeneous many-core devices.
Proceedings of the International Conference on High Performance Computing & Simulation, 2014

Tactical Versus Operational Discrete Event Simulation: A Breast Screening Case Study.
Proceedings of the 28th European Conference on Modelling and Simulation, 2014

2013
The Heuristic (Dark) Side of MIP Solvers.
Proceedings of the Hybrid Metaheuristics, 2013

Test-assignment: a quadratic coloring problem.
J. Heuristics, 2013

Mixed integer nonlinear programming tools: an updated practical overview.
Annals OR, 2013

A Complexity and Approximability Study of the Bilevel Knapsack Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012
Complexity and approximation of an area packing problem.
Optimization Letters, 2012

A storm of feasibility pumps for nonconvex MINLP.
Math. Program., 2012

An effective branch-and-bound algorithm for convex quadratic integer programming.
Math. Program., 2012

A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows.
INFORMS Journal on Computing, 2012

Bounding, filtering and diversification in CP-based local branching.
J. Heuristics, 2012

Exact algorithms for the two-dimensional guillotine knapsack.
Computers & OR, 2012

Models and Algorithms for Robust Network Design with Several Traffic Scenarios.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
MIPLIB 2010.
Math. Program. Comput., 2011

Computing compatible tours for the symmetric traveling salesman problem.
Math. Program. Comput., 2011

On the separation of disjunctive cuts.
Math. Program., 2011

Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX.
Management Science, 2011

Improving spectral bounds for clustering problems by Lagrangian relaxation.
ITOR, 2011

A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC.
Computer Networks, 2011

Mixed integer nonlinear programming tools: a practical overview.
4OR, 2011

On Counting Lattice Points and Chvátal-Gomory Cutting Planes.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

On Bilevel Programming and Its Impact in Branching, Cutting and Complexity.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

2010
Just MIP it!
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

Piecewise linear approximation of functions of two variables in MILP models.
Oper. Res. Lett., 2010

On interval-subgradient and no-good cuts.
Oper. Res. Lett., 2010

Efficient and fair routing for mesh networks.
Math. Program., 2010

Erratum to: MIR closures of polyhedral sets.
Math. Program., 2010

MIR closures of polyhedral sets.
Math. Program., 2010

On the knapsack closure of 0-1 Integer Linear Programs.
Electronic Notes in Discrete Mathematics, 2010

An approximation scheme for the two-stage, two-dimensional knapsack problem.
Discrete Optimization, 2010

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Experiments with Two Row Tableau Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Efficient Two-dimensional Data Allocation in IEEE 802.16 OFDMA.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program.
Proceedings of the Complex Systems Design & Management, 2010

Mixed Integer Programming Computation.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009
A Feasibility Pump for mixed integer nonlinear programs.
Math. Program., 2009

Bilevel Programming and Maximally Violated Valid Inequalities.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Projected Chvátal-Gomory cuts for mixed integer linear programs.
Math. Program., 2008

Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities.
Math. Oper. Res., 2008

An algorithmic framework for convex mixed integer nonlinear programs.
Discrete Optimization, 2008

Repairing MIP infeasibility through local branching.
Computers & OR, 2008

2007
Optimizing over the first Chvátal closure.
Math. Program., 2007

MIPping Closures: An Instant Survey.
Graphs and Combinatorics, 2007

A feasibility pump heuristic for general mixed-integer problems.
Discrete Optimization, 2007

The traveling salesman problem: a book review.
4OR, 2007

An optimization problem in the electricity market.
4OR, 2007

Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

On the MIR Closure of Polyhedra.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

CP-Based Local Branching.
Proceedings of the Principles and Practice of Constraint Programming, 2007

2006
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities.
Math. Oper. Res., 2006

Discrepancy-Based Additive Bounding Procedures.
INFORMS Journal on Computing, 2006

Packing into the smallest square: Worst-case analysis of lower bounds.
Discrete Optimization, 2006

An MINLP Solution Method for a Water Network Problem.
Proceedings of the Algorithms, 2006

2005
New approaches for optimizing over the semimetric polytope.
Math. Program., 2005

The feasibility pump.
Math. Program., 2005

Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing.
Math. Oper. Res., 2005

Optimizing over the First Chvàtal Closure.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

A Tale of Two Dimensional Bin Packing.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
On d-threshold graphs and d-dimensional bin packing.
Networks, 2004

Models and Bounds for Two-Dimensional Level Packing Problems.
J. Comb. Optim., 2004

TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems.
Annals OR, 2004

Optimizing over Semimetric Polytopes.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003
Integer linear programming models for 2-staged two-dimensional Knapsack problems.
Math. Program., 2003

Local branching.
Math. Program., 2003

Primal separation algorithms.
4OR, 2003

Discrepancy-Based Additive Bounding for the AllDifferent Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Multi-Dimensional Packing by Tabu Search.
Stud. Inform. Univ., 2002

Strengthening Chvátal-Gomory cuts and Gomory fractional cuts.
Oper. Res. Lett., 2002

Primal cutting plane algorithms revisited.
Math. Meth. of OR, 2002

A Hybrid Exact Algorithm for the TSPTW.
INFORMS Journal on Computing, 2002

Mathematical Programming Techniques in Constraint Programming: A Short Overview.
J. Heuristics, 2002

Heuristic algorithms for the three-dimensional bin packing problem.
European Journal of Operational Research, 2002

Two-dimensional packing problems: A survey.
European Journal of Operational Research, 2002

Recent advances on two-dimensional bin packing problems.
Discrete Applied Mathematics, 2002

Optimization-Oriented Global Constraints.
Constraints, 2002

Embedding Relaxations in Global Constraints for Solving TSP and TSPTW.
Ann. Math. Artif. Intell., 2002

Polynomial-Time Separation of Simple Comb Inequalities.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems.
Management Science, 2001

Efficient algorithms and codes for k-cardinality assignment problems.
Discrete Applied Mathematics, 2001

An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.
Proceedings of the Combinatorial Optimization, 2001

Solving Real-World ATSP Instances by Branch-and-Cut.
Proceedings of the Combinatorial Optimization, 2001

2000
Exact and heuristic algorithms for data sets reconstruction.
European Journal of Operational Research, 2000

Cutting Planes in Constraint Programming: A Hybrid Approach.
Proceedings of the Principles and Practice of Constraint Programming, 2000

1999
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems.
INFORMS Journal on Computing, 1999

Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method.
J. Heuristics, 1999

Approximation algorithms for the oriented two-dimensional bin packing problem.
European Journal of Operational Research, 1999

An evolutionary heuristic for quadratic 0-1 programming.
European Journal of Operational Research, 1999

Solving TSP through the Integration of OR and CP Techniques.
Electronic Notes in Discrete Mathematics, 1999

Soving TSP with Time Windows with Constraints.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

Cost-Based Domain Filtering.
Proceedings of the Principles and Practice of Constraint Programming, 1999


  Loading...