Andrea Lodi

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Operational Research: Methods and Applications
(available as arXiv preprint)
N/APaper
Assortment Optimization with Visibility Constraints
(available as arXiv preprint)
N/APaper
Machine learning augmented branch and bound for mixed integer linear programming
Mathematical Programming. Series A. Series B
2026-08-21Paper
Assortment optimization with visibility constraints
Mathematical Programming. Series A. Series B
2026-05-08Paper
Efficient branching rules for optimizing range and order-based objective functions
Mathematical Programming. Series A. Series B
2026-05-08Paper
Capacity variation in the many-to-one stable matching
Operations Research Letters
2026-04-24Paper
The differentiable feasibility pump2025-12-22Paper
Reducing income variability in natural resource portfolios via integer programming2025-11-19Paper
Recovering Dantzig-Wolfe bounds by cutting planes
Operations Research
2025-06-05Paper
Learning tabu search algorithms: a scheduling application
Computers & Operations Research
2025-05-26Paper
A framework for fair decision-making over time with time-invariant utilities
European Journal of Operational Research
2025-05-19Paper
Dynamic rebalancing optimization for bike-sharing systems: a modeling framework and empirical comparison
European Journal of Operational Research
2025-05-16Paper
Structured pruning of neural networks for constraints learning
Operations Research Letters
2025-05-05Paper
Primal heuristics in integer programming2025-02-26Paper
A new branching rule for range minimization problems2025-02-07Paper
Assortment optimization with visibility constraints2025-02-07Paper
The critical node game
Journal of Combinatorial Optimization
2024-11-28Paper
Optimizing fairness over time with homogeneous workers (short paper)2024-08-22Paper
Cardinality minimization, constraints, and regularization: a survey
SIAM Review
2024-08-09Paper
An exact method for (constrained) assortment optimization problems with product costs
INFORMS Journal on Computing
2024-07-29Paper
An improved column-generation-based matheuristic for learning classification trees
Computers & Operations Research
2024-06-25Paper
A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
Mathematical Programming. Series A. Series B
2024-04-09Paper
Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning
INFORMS Journal on Computing
2024-03-26Paper
Learning to repeatedly solve routing problems
Networks
2024-03-15Paper
A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs
Operations Research
2024-03-12Paper
Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities
INFORMS Journal on Computing
2024-02-27Paper
Fairness over time in dynamic resource allocation with an application in healthcare
Mathematical Programming. Series A. Series B
2024-02-21Paper
Deep Neural Networks Pruning via the Structured Perspective Regularization
SIAM Journal on Mathematics of Data Science
2024-01-11Paper
A New Branching Rule for Range Minimization Problems2023-11-07Paper
Neural networks for local search and crossover in vehicle routing: a possible overkill?
Integration of Constraint Programming, Artificial Intelligence, and Operations Research
2023-10-04Paper
Continuous cutting plane algorithms in integer programming
Operations Research Letters
2023-09-12Paper
Disjunctive cuts in mixed-integer conic optimization
Mathematical Programming. Series A. Series B
2023-05-02Paper
Disjunctive cuts in mixed-integer conic optimization
Mathematical Programming. Series A. Series B
2023-05-02Paper
Recovering Dantzig-Wolfe Bounds by Cutting Planes2023-01-30Paper
A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
Operations Research
2023-01-10Paper
A learning-based algorithm to quickly compute good primal solutions for stochastic integer programs
(available as arXiv preprint)
2022-12-21Paper
A Framework for Fair Decision-making Over Time with Time-invariant Utilities2022-12-20Paper
A theoretical and computational equilibria analysis of a multi-player kidney exchange program
European Journal of Operational Research
2022-10-17Paper
On generalized surrogate duality in mixed-integer nonlinear programming
Integer Programming and Combinatorial Optimization
2022-10-14Paper
An ILP Model for Multi-Label MRFs With Connectivity Constraints
IEEE Transactions on Image Processing
2022-09-16Paper
Measures of balance in combinatorial optimization
4OR
2022-08-26Paper
Computing equilibria for integer programming games
European Journal of Operational Research
2022-08-03Paper
On the Estimation of Discrete Choice Models to Capture Irrational Customer Behaviors
INFORMS Journal on Computing
2022-07-01Paper
Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information
INFORMS Journal on Computing
2022-06-28Paper
The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
INFORMS Journal on Computing
2022-06-27Paper
Cutting plane generation through sparse principal component analysis
SIAM Journal on Optimization
2022-06-17Paper
BDD-based optimization for the quadratic stable set problem
Discrete Optimization
2022-06-09Paper
Single allocation hub location with heterogeneous economies of scale
Operations Research
2022-05-31Paper
Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
Optimization and Engineering
2022-04-22Paper
Nonlinear chance-constrained problems with applications to hydro scheduling
Mathematical Programming. Series A. Series B
2022-03-22Paper
On generalized surrogate duality in mixed-integer nonlinear programming
Mathematical Programming. Series A. Series B
2022-03-22Paper
Guidelines for the computational testing of machine learning approaches to vehicle routing problems
Operations Research Letters
2022-03-11Paper
Design and implementation of a modular interior-point solver for linear optimization
Mathematical Programming Computation
2021-12-27Paper
Lattice reformulation cuts
SIAM Journal on Optimization
2021-11-05Paper
On the estimation of discrete choice models to capture irrational customer behaviors
(available as arXiv preprint)
2021-09-08Paper
An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs2021-09-07Paper
Learning chordal extensions
Journal of Global Optimization
2021-08-17Paper
Branch-price-and-cut algorithms for the vehicle routing problem with stochastic and correlated travel times
Operations Research
2021-06-17Paper
Multilevel approaches for the critical node problem
Operations Research
2021-06-17Paper
Tabu search for the time-dependent vehicle routing problem with time windows on a road network
European Journal of Operational Research
2021-06-03Paper
Machine learning for combinatorial optimization: a methodological tour d'horizon
European Journal of Operational Research
2021-06-03Paper
An exact algorithmic framework for a class of mixed-integer programs with equilibrium constraints
SIAM Journal on Optimization
2021-02-02Paper
Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
Constraints
2020-08-28Paper
A multicut outer-approximation approach for competitive facility location under random utilities
European Journal of Operational Research
2020-05-07Paper
Joint location and pricing within a user-optimized environment
EURO Journal on Computational Optimization
2020-03-25Paper
QPLIB: a library of quadratic programming instances
Mathematical Programming Computation
2019-12-19Paper
A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs
(available as arXiv preprint)
2019-12-17Paper
Ten years of feasibility pump, and counting
EURO Journal on Computational Optimization
2019-10-18Paper
Using cost-based solution densities from TSP relaxations to solve routing problems2019-10-14Paper
Learning MILP resolution outcomes before reaching time-limit2019-10-14Paper
A polynomial algorithm for a continuous bilevel knapsack problem
Operations Research Letters
2019-06-11Paper
Solving Quadratic Programming by Cutting Planes
SIAM Journal on Optimization
2019-05-07Paper
A comparison of optimization methods for multi-objective constrained bin packing problems2018-11-21Paper
Learning a classification of mixed-integer quadratic programming problems2018-11-21Paper
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics
IEEE Transactions on Signal Processing
2018-08-22Paper
Experiments on virtual private network design with concave capacity costs
Optimization Letters
2018-07-31Paper
On the difficulty of virtual private network instances
Networks
2018-05-23Paper
Integral simplex using decomposition with primal cutting planes
Mathematical Programming. Series A. Series B
2017-12-01Paper
On learning and branching: a survey
Top
2017-10-12Paper
Rejoinder on: ``On learning and branching: a survey''
Top
2017-10-12Paper
Cutting planes from wide split disjunctions2017-08-31Paper
Bounding, filtering and diversification in CP-based local branching
Journal of Heuristics
2017-04-04Paper
On the practical strength of two-row tableau cuts
INFORMS Journal on Computing
2017-02-17Paper
Nash equilibria in the two-player kidney exchange game
Mathematical Programming. Series A. Series B
2017-02-03Paper
Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
Discrete Applied Mathematics
2016-12-22Paper
On handling indicator constraints in mixed integer programming
Computational Optimization and Applications
2016-12-15Paper
Mathematical programming techniques in water network optimization
European Journal of Operational Research
2016-10-06Paper
Erratum to ``Mathematical programming techniques in water network optimization''
European Journal of Operational Research
2016-10-06Paper
Bilevel knapsack with interdiction constraints
INFORMS Journal on Computing
2016-08-12Paper
A time bucket formulation for the traveling salesman problem with time windows
INFORMS Journal on Computing
2016-06-29Paper
Optimistic MILP modeling of non-linear optimization problems
European Journal of Operational Research
2016-06-24Paper
Single-commodity robust network design problem: complexity, instances and heuristic solutions
European Journal of Operational Research
2016-06-23Paper
Single-commodity robust network design with finite and hose demand sets
Mathematical Programming. Series A. Series B
2016-06-06Paper
Improving branch-and-cut performance by random sampling
Mathematical Programming Computation
2016-04-13Paper
Virtual private network design over the first Chvátal closure
RAIRO - Operations Research
2015-08-14Paper
On mathematical programming with indicator constraints
Mathematical Programming. Series A. Series B
2015-06-19Paper
A study on the computational complexity of the bilevel knapsack problem
SIAM Journal on Optimization
2014-09-26Paper
Bilevel programming and the separation problem
Mathematical Programming. Series A. Series B
2014-08-29Paper
On the optimal design of water distribution networks: a practical MINLP approach
Optimization and Engineering
2014-08-20Paper
On the knapsack closure of 0-1 integer linear programs2013-11-08Paper
Mixed integer nonlinear programming tools: an updated practical overview
Annals of Operations Research
2013-08-08Paper
← Previous 100   1   2   Next 100 →


Research outcomes over time


This page was built for person: Andrea Lodi