An MINLP Solution Method for a Water Network Problem. - Cristiana Bragalli; Claudia D'Ambrosio; Jon Lee 001; Andrea Lodi 001; Paolo Toth (ESA, 2006)

A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity. - Claudia D'Ambrosio; Jon Lee 001; Andreas Wächter (ESA, 2009)

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. - Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti; Andrea Lodi 001 (SEA, 2010)

Application-oriented mixed integer non-linear programming. - Claudia D'Ambrosio (4OR, 2010)

On interval-subgradient and no-good cuts. - Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti; Andrea Lodi 001 (Oper. Res. Lett., 2010)

Piecewise linear approximation of functions of two variables in MILP models. - Claudia D'Ambrosio; Andrea Lodi 001; Silvano Martello (Oper. Res. Lett., 2010)

Valid Inequalities for the Pooling Problem with Binary Variables. - Claudia D'Ambrosio; Jeff T. Linderoth; James R. Luedtke (IPCO, 2011)

Mixed integer nonlinear programming tools: a practical overview. - Claudia D'Ambrosio; Andrea Lodi 001 (4OR, 2011)

Heuristic algorithms for the general nonlinear separable knapsack problem. - Claudia D'Ambrosio; Silvano Martello (Comput. Oper. Res., 2011)

A storm of feasibility pumps for nonconvex MINLP. - Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti; Andrea Lodi 001 (Math. Program., 2012)

Mixed integer nonlinear programming tools: an updated practical overview. - Claudia D'Ambrosio; Andrea Lodi 001 (Ann. Oper. Res., 2013)

Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators. - Christoph Buchheim; Claudia D'Ambrosio (IPCO, 2014)

Optimistic MILP modeling of non-linear optimization problems. - Riccardo Rovatti; Claudia D'Ambrosio; Andrea Lodi 001; Silvano Martello (Eur. J. Oper. Res., 2014)

Graphsj 3: a Modern Didactic Application for Graph Algorithms. - Gianluca Costa; Claudia D'Ambrosio; Silvano Martello (J. Comput. Sci., 2014)

Observing the State of a Smart Grid Using Bilevel Programming. - Sonia Toubaline; Pierre-Louis Poirion; Claudia D'Ambrosio; Leo Liberti (COCOA, 2015)

On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space. - Claudia D'Ambrosio; Marcia Fampa; Jon Lee 001; Stefan Vigerske (SEA, 2015)

Mathematical programming techniques in water network optimization. - Claudia D'Ambrosio; Andrea Lodi 001; Sven Wiese; Cristiana Bragalli (Eur. J. Oper. Res., 2015)

Erratum to "Mathematical programming techniques in water network optimization" [Eur. J. Oper. Res. 243(2015) 774-788]. - Claudia D'Ambrosio; Andrea Lodi 001; Sven Wiese; Cristiana Bragalli (Eur. J. Oper. Res., 2015)

Controlling the Average Behavior of Business Rules Programs. - Olivier Wang; Leo Liberti; Claudia D'Ambrosio; Christian de Sainte Marie; Changhai Ke (RuleML, 2016)

Heuristics for the General Multiple Non-linear Knapsack Problem. - Luca Mencarelli; Claudia D'Ambrosio; Angelo Di Zio; Silvano Martello (Electron. Notes Discret. Math., 2016)

The power edge set problem. - Pierre-Louis Poirion; Sonia Toubaline; Claudia D'Ambrosio; Leo Liberti (Networks, 2016)

Distance Geometry in Linearizable Norms. - Claudia D'Ambrosio; Leo Liberti (GSI, 2017)

The Isomap Algorithm in Distance Geometry. - Leo Liberti; Claudia D'Ambrosio (SEA, 2017)

New Error Measures and Methods for Realizing Protein Graphs from Distance Data. - Claudia D'Ambrosio; Ky Khac Vu; Carlile Lavor; Leo Liberti; Nelson Maculan (Discret. Comput. Geom., 2017)

Special issue on: Nonlinear and combinatorial methods for energy optimization. - Claudia D'Ambrosio; Antonio Frangioni; Andrea Lodi 001; Martin Mevissen (EURO J. Comput. Optim., 2017)

A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs. - Valentina Cacchiani; Claudia D'Ambrosio (Eur. J. Oper. Res., 2017)

Surrogate-based methods for black-box optimization. - Ky Khac Vu; Claudia D'Ambrosio; Youssef Hamadi; Leo Liberti (Int. Trans. Oper. Res., 2017)

Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization. - Christoph Buchheim; Claudia D'Ambrosio (J. Glob. Optim., 2017)

MILP models for the selection of a small set of well-distributed points. - Claudia D'Ambrosio; Giacomo Nannicini; Giorgio Sartor (Oper. Res. Lett., 2017)

Maximum Concurrent Flow with Incomplete Data. - Pierre-Olivier Bauguion; Claudia D'Ambrosio; Leo Liberti (ISCO, 2018)

Relaxations and heuristics for the multiple non-linear separable knapsack problem. - Claudia D'Ambrosio; Silvano Martello; Luca Mencarelli (Comput. Oper. Res., 2018)

Shortest Path Problem variants for the Hydro Unit Commitment Problem. - Wim van Ackooij; Claudia D'Ambrosio; Leo Liberti; Raouia Taktak; Dimitri Thomopulos; Sonia Toubaline (Electron. Notes Discret. Math., 2018)

Complexity and inapproximability results for the Power Edge Set problem. - Sonia Toubaline; Claudia D'Ambrosio; Leo Liberti; Pierre-Louis Poirion; Baruch Schieber; Hadas Shachnai (J. Comb. Optim., 2018)

Feasibility pump for aircraft deconfliction with speed regulation. - Sonia Cafieri; Claudia D'Ambrosio (J. Glob. Optim., 2018)

On the Product Knapsack Problem. - Claudia D'Ambrosio; Fabio Furini; Michele Monaci; Emiliano Traversi (Optim. Lett., 2018)

Random Projections for Quadratic Programs over a Euclidean Ball. - Ky Khac Vu; Pierre-Louis Poirion; Claudia D'Ambrosio; Leo Liberti (IPCO, 2019)

On the Observability of Smart Grids and Related Optimization Methods. - Claudia D'Ambrosio; Leo Liberti; Pierre-Louis Poirion; Sonia Toubaline (OR, 2019)

Complex portfolio selection via convex mixed-integer quadratic programming: a survey. - Luca Mencarelli; Claudia D'Ambrosio (Int. Trans. Oper. Res., 2019)

Strengthening the sequential convex MINLP technique by perspective reformulations. - Claudia D'Ambrosio; Antonio Frangioni; Claudio Gentile (Optim. Lett., 2019)

Handling Separable Non-convexities Using Disjunctive Cuts. - Claudia D'Ambrosio; Jon Lee 001; Daphne E. Skipper; Dimitri Thomopulos (ISCO, 2020)

Learning to Configure Mathematical Programming Solvers by Mathematical Programming. - Gabriele Iommazzo; Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti (LION, 2020)

A Learning-Based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers. - Gabriele Iommazzo; Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti (LOD (1), 2020)

Lower and upper bounds for the non-linear generalized assignment problem. - Claudia D'Ambrosio; Silvano Martello; Michele Monaci (Comput. Oper. Res., 2020)

Algorithms and applications for a class of bilevel MILPs. - Pierre-Louis Poirion; Sonia Toubaline; Claudia D'Ambrosio; Leo Liberti (Discret. Appl. Math., 2020)

Random projections for quadratic programs. - Claudia D'Ambrosio; Leo Liberti; Pierre-Louis Poirion; Ky Khac Vu (Math. Program., 2020)

On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. - Claudia D'Ambrosio; Marcia Fampa; Jon Lee 001; Stefan Vigerske (Optim. Lett., 2020)

Strong Convex Nonlinear Relaxations of the Pooling Problem. - James R. Luedtke; Claudia D'Ambrosio; Jeff T. Linderoth; Jonas Schweiger (SIAM J. Optim., 2020)

Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley. - Wim van Ackooij; Claudia D'Ambrosio; Dimitri Thomopulos; Renan Spencer Trindade (Eur. J. Oper. Res., 2021)

Detecting and solving aircraft conflicts using bilevel programming. - Martina Cerulli; Claudia D'Ambrosio; Leo Liberti; Mercedes Pelegrín (J. Glob. Optim., 2021)

Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice. - Ruobing Shen; Bo Tang 017; Leo Liberti; Claudia D'Ambrosio; Stéphane Canu (J. Glob. Optim., 2021)

Convergent Algorithms for a Class of Convex Semi-infinite Programs. - Martina Cerulli; Antoine Oustry; Claudia D'Ambrosio; Leo Liberti (SIAM J. Optim., 2022)

Aircraft Deconfliction via Mathematical Programming: Review and Insights. - Mercedes Pelegrín; Claudia D'Ambrosio (Transp. Sci., 2022)

Optimal Battery Charge Scheduling For Revenue Stacking Under Operational Constraints Via Energy Arbitrage. - Alban Puech; Gorazd Dimitrov; Claudia D'Ambrosio (ISGT EUROPE, 2023)

A Comparison of Formulations for Aircraft Deconfliction. - Renan Spencer Trindade; Claudia D'Ambrosio (NUMTA (1), 2023)

Branch and price for submodular bin packing. - Liding Xu; Claudia D'Ambrosio; Sonia Haddad-Vanier; Emiliano Traversi (EURO J. Comput. Optim., 2023)

Optimal deployment of indoor wireless local area networks. - Antoine Oustry; Marion Le Tilly; Thomas Heide Clausen; Claudia D'Ambrosio; Leo Liberti (Networks, 2023)

Urban air mobility: from complex tactical conflict resolution to network design and fairness insights. - Mercedes Pelegrín; Claudia D'Ambrosio; Rémi Delmas; Youssef Hamadi (Optim. Methods Softw., 2023)

Comparing perspective reformulations for piecewise-convex optimization. - Renan Spencer Trindade; Claudia D'Ambrosio; Antonio Frangioni; Claudio Gentile (Oper. Res. Lett., 2023)

On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location. - Claudia D'Ambrosio; Marcia Fampa; Jon Lee 001; Felipe Sinnecker (ISCO, 2024)

A Robust Two-Stage Model for the Urban Air Mobility Flight Scheduling Problem. - Tom Portoleau; Claudia D'Ambrosio (ISCO, 2024)

Optimal Risk Scores for Continuous Predictors. - Cristina Molero-Río; Claudia D'Ambrosio (LOD (1), 2024)

The Algorithm Configuration Problem. - Gabriele Iommazzo; Claudia D'Ambrosio; Antonio Frangioni; Leo Liberti (CoRR, 2024)

The MIP Workshop 2023 Computational Competition on reoptimization. - Suresh Bolusani; Mathieu Besançon; Ambros M. Gleixner; Timo Berthold; Claudia D'Ambrosio; Gonzalo Muñoz 001; Joseph Paat; Dimitri Thomopulos (Math. Program. Comput., 2024)

Cutting Planes for Signomial Programming. - Liding Xu; Claudia D'Ambrosio; Leo Liberti; Sonia Haddad-Vanier (SIAM J. Optim., 2025)