The following pages link to Andrea Lodi (Q239553):
Displaying 50 items.
- (Q3368660) (← links)
- CP-Based Local Branching (Q3523091) (← links)
- Mixed Integer Programming Computation (Q3565245) (← links)
- An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming (Q3569825) (← links)
- Experiments with Two Row Tableau Cuts (Q3569836) (← links)
- Optimizing over the First Chvàtal Closure (Q3596349) (← links)
- (Q4414638) (← links)
- (Q4414642) (← links)
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems (Q4427380) (← links)
- Local Search and Constraint Programming (Q4452902) (← links)
- (Q4461906) (← links)
- (Q4461918) (← links)
- (Q4473026) (← links)
- (Q4495176) (← links)
- Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics (Q4579087) (← links)
- Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
- On the difficulty of virtual private network instances (Q4642482) (← links)
- (Q4667439) (← links)
- (Q4667443) (← links)
- (Q4737521) (← links)
- (Q4737536) (← links)
- A Complexity and Approximability Study of the Bilevel Knapsack Problem (Q4910808) (← links)
- Improving spectral bounds for clustering problems by Lagrangian relaxation (Q4918244) (← links)
- Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times (Q4994167) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)
- Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information (Q5084648) (← links)
- The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints (Q5085468) (← links)
- On the Estimation of Discrete Choice Models to Capture Irrational Customer Behaviors (Q5087727) (← links)
- An ILP Model for Multi-Label MRFs With Connectivity Constraints (Q5105684) (← links)
- An Exact Algorithmic Framework for a Class of Mixed-Integer Programs with Equilibrium Constraints (Q5147029) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities (Q5388004) (← links)
- On the MIR Closure of Polyhedra (Q5429278) (← links)
- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities (Q5429286) (← links)
- An MINLP Solution Method for a Water Network Problem (Q5449573) (← links)
- Virtual private network design over the first Chvátal closure (Q5501875) (← links)
- (Q5692638) (← links)
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing (Q5704216) (← links)
- Integer Programming and Combinatorial Optimization (Q5712472) (← links)
- Mathematical programming techniques in constraint programming: a short overview (Q5960028) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- Continuous cutting plane algorithms in integer programming (Q6047699) (← links)
- Fairness over time in dynamic resource allocation with an application in healthcare (Q6120930) (← links)
- Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities (Q6121571) (← links)
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)
- Deep Neural Networks Pruning via the Structured Perspective Regularization (Q6148352) (← links)
