Claudia D'Ambrosio

According to our database1, Claudia D'Ambrosio authored at least 46 papers between 2006 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 





Strong Convex Nonlinear Relaxations of the Pooling Problem.
SIAM J. Optim., 2020

On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs.
Optim. Lett., 2020

Random projections for quadratic programs.
Math. Program., 2020

Algorithms and applications for a class of bilevel MILPs.
Discret. Appl. Math., 2020

Lower and upper bounds for the non-linear generalized assignment problem.
Comput. Oper. Res., 2020

Learning to Configure Mathematical Programming Solvers by Mathematical Programming.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

Handling Separable Non-convexities Using Disjunctive Cuts.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

Strengthening the sequential convex MINLP technique by perspective reformulations.
Optim. Lett., 2019

Complex portfolio selection via convex mixed-integer quadratic programming: a survey.
Int. Trans. Oper. Res., 2019

On the Observability of Smart Grids and Related Optimization Methods.
Proceedings of the Operations Research Proceedings 2019, 2019

Random Projections for Quadratic Programs over a Euclidean Ball.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

On the Product Knapsack Problem.
Optim. Lett., 2018

Feasibility pump for aircraft deconfliction with speed regulation.
J. Glob. Optim., 2018

Complexity and inapproximability results for the Power Edge Set problem.
J. Comb. Optim., 2018

Shortest Path Problem variants for the Hydro Unit Commitment Problem.
Electron. Notes Discret. Math., 2018

Relaxations and heuristics for the multiple non-linear separable knapsack problem.
Comput. Oper. Res., 2018

Maximum Concurrent Flow with Incomplete Data.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

MILP models for the selection of a small set of well-distributed points.
Oper. Res. Lett., 2017

Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization.
J. Glob. Optim., 2017

Surrogate-based methods for black-box optimization.
Int. Trans. Oper. Res., 2017

A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs.
Eur. J. Oper. Res., 2017

Special issue on: Nonlinear and combinatorial methods for energy optimization.
EURO J. Comput. Optim., 2017

New Error Measures and Methods for Realizing Protein Graphs from Distance Data.
Discret. Comput. Geom., 2017

The Isomap Algorithm in Distance Geometry.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Distance Geometry in Linearizable Norms.
Proceedings of the Geometric Science of Information - Third International Conference, 2017

The power edge set problem.
Networks, 2016

Heuristics for the General Multiple Non-linear Knapsack Problem.
Electron. Notes Discret. Math., 2016

Controlling the Average Behavior of Business Rules Programs.
Proceedings of the Rule Technologies. Research, Tools, and Applications, 2016

Erratum to "Mathematical programming techniques in water network optimization" [Eur. J. Oper. Res. 243(2015) 774-788].
Eur. J. Oper. Res., 2015

Mathematical programming techniques in water network optimization.
Eur. J. Oper. Res., 2015

On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Observing the State of a Smart Grid Using Bilevel Programming.
Proceedings of the Combinatorial Optimization and Applications, 2015

Graphsj 3: a Modern Didactic Application for Graph Algorithms.
J. Comput. Sci., 2014

Optimistic MILP modeling of non-linear optimization problems.
Eur. J. Oper. Res., 2014

Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators.
Proceedings of the Integer Programming and Combinatorial Optimization, 2014

Mixed integer nonlinear programming tools: an updated practical overview.
Ann. Oper. Res., 2013

A storm of feasibility pumps for nonconvex MINLP.
Math. Program., 2012

Heuristic algorithms for the general nonlinear separable knapsack problem.
Comput. Oper. Res., 2011

Mixed integer nonlinear programming tools: a practical overview.
4OR, 2011

Valid Inequalities for the Pooling Problem with Binary Variables.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Piecewise linear approximation of functions of two variables in MILP models.
Oper. Res. Lett., 2010

On interval-subgradient and no-good cuts.
Oper. Res. Lett., 2010

Application-oriented mixed integer non-linear programming.
4OR, 2010

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity.
Proceedings of the Algorithms, 2009

An MINLP Solution Method for a Water Network Problem.
Proceedings of the Algorithms, 2006