The following pages link to Andrea Lodi (Q239553):
Displaying 50 items.
- Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
- A theoretical and computational equilibria analysis of a multi-player kidney exchange program (Q2083966) (← links)
- A learning-based algorithm to quickly compute good primal solutions for stochastic integer programs (Q2110391) (← links)
- Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
- On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
- Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound (Q2129196) (← links)
- Computing equilibria for integer programming games (Q2160491) (← links)
- Measures of balance in combinatorial optimization (Q2168777) (← links)
- A multicut outer-approximation approach for competitive facility location under random utilities (Q2178115) (← links)
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem (Q2195980) (← links)
- Piecewise linear approximation of functions of two variables in MILP models (Q2270322) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Joint location and pricing within a user-optimized environment (Q2308187) (← links)
- Using cost-based solution densities from TSP relaxations to solve routing problems (Q2327249) (← links)
- Learning MILP resolution outcomes before reaching time-limit (Q2327258) (← links)
- Ten years of feasibility pump, and counting (Q2329705) (← links)
- On mathematical programming with indicator constraints (Q2349121) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- Cutting planes from wide split disjunctions (Q2401148) (← links)
- On learning and branching: a survey (Q2408515) (← links)
- Rejoinder on: ``On learning and branching: a survey'' (Q2408517) (← links)
- A polynomial algorithm for a continuous bilevel knapsack problem (Q2417096) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- An optimization problem in the electricity market (Q2477620) (← links)
- The feasibility pump (Q2571001) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- Efficient and fair routing for mesh networks (Q2638366) (← links)
- Guidelines for the computational testing of machine learning approaches to vehicle routing problems (Q2670511) (← links)
- BDD-based optimization for the quadratic stable set problem (Q2673237) (← links)
- Solving TSP through the integration of OR and CP techniques (Q2741259) (← links)
- A time bucket formulation for the traveling salesman problem with time windows (Q2815434) (← links)
- On the knapsack closure of 0-1 integer linear programs (Q2861491) (← links)
- A hybrid exact algorithm for the TSPTW (Q2884545) (← links)
- Discrepancy-based additive bounding procedures (Q2892304) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- On Bilevel Programming and Its Impact in Branching, Cutting and Complexity (Q3003270) (← links)
- On Counting Lattice Points and Chvátal-Gomory Cutting Planes (Q3003282) (← links)
- (Q3059312) (← links)
- Hybrid Solving Techniques (Q3064562) (← links)
- (Q3109952) (← links)
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems (Q3114703) (← links)
- Ond-threshold graphs andd-dimensional bin packing (Q3157035) (← links)
- Models and Algorithms for Robust Network Design with Several Traffic Scenarios (Q3167631) (← links)
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities (Q3168976) (← links)
- Bilevel Knapsack with Interdiction Constraints (Q3186662) (← links)
- A Study on the Computational Complexity of the Bilevel Knapsack Problem (Q3192105) (← links)
