The following pages link to Andrea Lodi (Q239553):
Displaying 50 items.
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- Optimistic MILP modeling of non-linear optimization problems (Q297051) (← links)
- Mathematical programming techniques in water network optimization (Q319201) (← links)
- Erratum to ``Mathematical programming techniques in water network optimization'' (Q319577) (← links)
- On the optimal design of water distribution networks: a practical MINLP approach (Q400003) (← links)
- Bilevel programming and the separation problem (Q403662) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- Nash equilibria in the two-player kidney exchange game (Q507331) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- (Q691399) (redirect page) (← links)
- Complexity and approximation of an area packing problem (Q691403) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- TSpack: A unified tabu search code for multi-dimensional bin packing problems (Q702723) (← links)
- An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
- Experiments on virtual private network design with concave capacity costs (Q723484) (← links)
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints (Q729798) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- MIR closures of polyhedral sets (Q847821) (← links)
- Packing into the smallest square: worst-case analysis of lower bounds (Q865748) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Erratum to: MIR closures of polyhedral sets (Q964184) (← links)
- A feasibility pump for mixed integer nonlinear programs (Q1013979) (← links)
- Primal cutting plane algorithms revisited (Q1396918) (← links)
- Integer linear programming models for 2-staged two-dimensional knapsack problems (Q1411613) (← links)
- Primal separation algorithms (Q1416099) (← links)
- Local branching (Q1424277) (← links)
- Exact and heuristic algorithms for data sets reconstruction (Q1576347) (← links)
- Embedding relaxations in global constraints for solving TSP and TSPTW (Q1601928) (← links)
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007) (← links)
- A comparison of optimization methods for multi-objective constrained bin packing problems (Q1626770) (← links)
- Learning a classification of mixed-integer quadratic programming problems (Q1626794) (← links)
- Integral simplex using decomposition with primal cutting planes (Q1683694) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- Solution of the cumulative assignment problem with a well-structured tabu search method (Q1806772) (← links)
- Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
- An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- Heuristic algorithms for the three-dimensional bin packing problem (Q1847192) (← links)
- Optimization-oriented global constraints (Q1871972) (← links)
- Models and bounds for two-dimensional level packing problems (Q1888172) (← links)
- A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
- Tabu search for the time-dependent vehicle routing problem with time windows on a road network (Q2028848) (← links)
- Machine learning for combinatorial optimization: a methodological tour d'horizon (Q2029358) (← links)
- Learning chordal extensions (Q2046324) (← links)
