default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaudia D'Ambrosio
Person information
- affiliation: École Polytechnique, Palaiseau, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j41]Suresh Bolusani
, Mathieu Besançon, Ambros M. Gleixner, Timo Berthold, Claudia D'Ambrosio, Gonzalo Muñoz, Joseph Paat, Dimitri Thomopulos:
The MIP Workshop 2023 Computational Competition on reoptimization. Math. Program. Comput. 16(2): 255-266 (2024)- [c19]Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Felipe Sinnecker:
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location. ISCO 2024: 16-29 - [c18]Tom Portoleau, Claudia D'Ambrosio:
A Robust Two-Stage Model for the Urban Air Mobility Flight Scheduling Problem. ISCO 2024: 348-360 - [i5]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
A learning-based mathematical programming formulation for the automatic configuration of optimization solvers. CoRR abs/2401.04237 (2024) - [i4]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
Learning to Configure Mathematical Programming Solvers by Mathematical Programming. CoRR abs/2401.05041 (2024) - [i3]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
The Algorithm Configuration Problem. CoRR abs/2403.00898 (2024) - 2023
- [j40]Liding Xu, Claudia D'Ambrosio, Sonia Haddad-Vanier, Emiliano Traversi:
Branch and price for submodular bin packing. EURO J. Comput. Optim. 11: 100074 (2023) - [j39]Antoine Oustry, Marion Le Tilly, Thomas Heide Clausen, Claudia D'Ambrosio, Leo Liberti:
Optimal deployment of indoor wireless local area networks. Networks 81(1): 23-50 (2023) - [j38]Mercedes Pelegrín, Claudia D'Ambrosio, Rémi Delmas, Youssef Hamadi:
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights. Optim. Methods Softw. 38(6): 1311-1343 (2023) - [j37]Renan Spencer Trindade, Claudia D'Ambrosio, Antonio Frangioni, Claudio Gentile:
Comparing perspective reformulations for piecewise-convex optimization. Oper. Res. Lett. 51(6): 702-708 (2023) - [c17]Alban Puech, Gorazd Dimitrov, Claudia D'Ambrosio:
Optimal Battery Charge Scheduling For Revenue Stacking Under Operational Constraints Via Energy Arbitrage. ISGT EUROPE 2023: 1-5 - [i2]Alban Puech, Gorazd Dimitrov, Claudia D'Ambrosio:
Optimal Battery Charge Scheduling For Revenue Stacking Under Operational Constraints Via Energy Arbitrage. CoRR abs/2305.04566 (2023) - 2022
- [j36]Martina Cerulli, Antoine Oustry, Claudia D'Ambrosio, Leo Liberti:
Convergent Algorithms for a Class of Convex Semi-infinite Programs. SIAM J. Optim. 32(4): 2493-2526 (2022) - [j35]Mercedes Pelegrín, Claudia D'Ambrosio:
Aircraft Deconfliction via Mathematical Programming: Review and Insights. Transp. Sci. 56(1): 118-140 (2022) - 2021
- [j34]Wim van Ackooij, Claudia D'Ambrosio, Dimitri Thomopulos, Renan Spencer Trindade:
Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley. Eur. J. Oper. Res. 291(3): 935-943 (2021) - [j33]Ruobing Shen, Bo Tang, Leo Liberti, Claudia D'Ambrosio, Stéphane Canu:
Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice. J. Glob. Optim. 81(1): 85-108 (2021) - [j32]Martina Cerulli, Claudia D'Ambrosio, Leo Liberti, Mercedes Pelegrín:
Detecting and solving aircraft conflicts using bilevel programming. J. Glob. Optim. 81(2): 529-557 (2021) - 2020
- [j31]Claudia D'Ambrosio, Silvano Martello, Michele Monaci:
Lower and upper bounds for the non-linear generalized assignment problem. Comput. Oper. Res. 120: 104933 (2020) - [j30]Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti:
Algorithms and applications for a class of bilevel MILPs. Discret. Appl. Math. 272: 75-89 (2020) - [j29]Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Ky Khac Vu:
Random projections for quadratic programs. Math. Program. 183(1): 619-647 (2020) - [j28]Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske:
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. Optim. Lett. 14(2): 409-415 (2020) - [j27]James R. Luedtke, Claudia D'Ambrosio, Jeff T. Linderoth, Jonas Schweiger:
Strong Convex Nonlinear Relaxations of the Pooling Problem. SIAM J. Optim. 30(2): 1582-1609 (2020) - [c16]Claudia D'Ambrosio, Jon Lee, Daphne E. Skipper, Dimitri Thomopulos:
Handling Separable Non-convexities Using Disjunctive Cuts. ISCO 2020: 102-114 - [c15]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
Learning to Configure Mathematical Programming Solvers by Mathematical Programming. LION 2020: 377-389 - [c14]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
A Learning-Based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers. LOD (1) 2020: 700-712
2010 – 2019
- 2019
- [j26]Luca Mencarelli, Claudia D'Ambrosio:
Complex portfolio selection via convex mixed-integer quadratic programming: a survey. Int. Trans. Oper. Res. 26(2): 389-414 (2019) - [j25]Claudia D'Ambrosio, Antonio Frangioni, Claudio Gentile:
Strengthening the sequential convex MINLP technique by perspective reformulations. Optim. Lett. 13(4): 673-684 (2019) - [c13]Ky Khac Vu, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti:
Random Projections for Quadratic Programs over a Euclidean Ball. IPCO 2019: 442-452 - [c12]Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Sonia Toubaline:
On the Observability of Smart Grids and Related Optimization Methods. OR 2019: 281-287 - 2018
- [j24]Claudia D'Ambrosio, Silvano Martello, Luca Mencarelli:
Relaxations and heuristics for the multiple non-linear separable knapsack problem. Comput. Oper. Res. 93: 79-89 (2018) - [j23]Wim van Ackooij, Claudia D'Ambrosio, Leo Liberti, Raouia Taktak, Dimitri Thomopulos, Sonia Toubaline:
Shortest Path Problem variants for the Hydro Unit Commitment Problem. Electron. Notes Discret. Math. 69: 309-316 (2018) - [j22]Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai:
Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. 35(3): 895-905 (2018) - [j21]Sonia Cafieri, Claudia D'Ambrosio:
Feasibility pump for aircraft deconfliction with speed regulation. J. Glob. Optim. 71(3): 501-515 (2018) - [j20]Claudia D'Ambrosio, Fabio Furini, Michele Monaci, Emiliano Traversi:
On the Product Knapsack Problem. Optim. Lett. 12(4): 691-712 (2018) - [c11]Pierre-Olivier Bauguion, Claudia D'Ambrosio, Leo Liberti:
Maximum Concurrent Flow with Incomplete Data. ISCO 2018: 77-88 - 2017
- [j19]Claudia D'Ambrosio, Ky Khac Vu, Carlile Lavor, Leo Liberti, Nelson Maculan:
New Error Measures and Methods for Realizing Protein Graphs from Distance Data. Discret. Comput. Geom. 57(2): 371-418 (2017) - [j18]Claudia D'Ambrosio, Antonio Frangioni, Andrea Lodi, Martin Mevissen:
Special issue on: Nonlinear and combinatorial methods for energy optimization. EURO J. Comput. Optim. 5(1-2): 1-3 (2017) - [j17]Valentina Cacchiani, Claudia D'Ambrosio:
A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs. Eur. J. Oper. Res. 260(3): 920-933 (2017) - [j16]Ky Khac Vu, Claudia D'Ambrosio, Youssef Hamadi, Leo Liberti:
Surrogate-based methods for black-box optimization. Int. Trans. Oper. Res. 24(3): 393-424 (2017) - [j15]Christoph Buchheim, Claudia D'Ambrosio:
Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization. J. Glob. Optim. 67(4): 759-786 (2017) - [j14]Claudia D'Ambrosio, Giacomo Nannicini, Giorgio Sartor:
MILP models for the selection of a small set of well-distributed points. Oper. Res. Lett. 45(1): 46-52 (2017) - [c10]Claudia D'Ambrosio, Leo Liberti:
Distance Geometry in Linearizable Norms. GSI 2017: 830-837 - [c9]Leo Liberti, Claudia D'Ambrosio:
The Isomap Algorithm in Distance Geometry. SEA 2017: 5:1-5:13 - 2016
- [j13]Luca Mencarelli, Claudia D'Ambrosio, Angelo Di Zio, Silvano Martello:
Heuristics for the General Multiple Non-linear Knapsack Problem. Electron. Notes Discret. Math. 55: 69-72 (2016) - [j12]Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti:
The power edge set problem. Networks 68(2): 104-120 (2016) - [c8]Olivier Wang, Leo Liberti, Claudia D'Ambrosio, Christian de Sainte Marie, Changhai Ke:
Controlling the Average Behavior of Business Rules Programs. RuleML 2016: 83-96 - [i1]Claudia D'Ambrosio, Ky Khac Vu, Carlile Lavor, Leo Liberti, Nelson Maculan:
New error measures and methods for realizing protein graphs from distance data. CoRR abs/1607.00868 (2016) - 2015
- [j11]Claudia D'Ambrosio, Andrea Lodi, Sven Wiese, Cristiana Bragalli:
Mathematical programming techniques in water network optimization. Eur. J. Oper. Res. 243(3): 774-788 (2015) - [j10]Claudia D'Ambrosio, Andrea Lodi, Sven Wiese, Cristiana Bragalli:
Erratum to "Mathematical programming techniques in water network optimization" [Eur. J. Oper. Res. 243(2015) 774-788]. Eur. J. Oper. Res. 245(1): 338 (2015) - [c7]Sonia Toubaline, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti:
Observing the State of a Smart Grid Using Bilevel Programming. COCOA 2015: 364-376 - [c6]Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske:
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space. SEA 2015: 122-133 - 2014
- [j9]Riccardo Rovatti, Claudia D'Ambrosio, Andrea Lodi, Silvano Martello:
Optimistic MILP modeling of non-linear optimization problems. Eur. J. Oper. Res. 239(1): 32-45 (2014) - [j8]Gianluca Costa, Claudia D'Ambrosio, Silvano Martello:
Graphsj 3: a Modern Didactic Application for Graph Algorithms. J. Comput. Sci. 10(7): 1115-1119 (2014) - [c5]Christoph Buchheim, Claudia D'Ambrosio:
Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators. IPCO 2014: 198-209 - 2013
- [j7]Claudia D'Ambrosio, Andrea Lodi:
Mixed integer nonlinear programming tools: an updated practical overview. Ann. Oper. Res. 204(1): 301-320 (2013) - 2012
- [j6]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
A storm of feasibility pumps for nonconvex MINLP. Math. Program. 136(2): 375-402 (2012) - 2011
- [j5]Claudia D'Ambrosio, Andrea Lodi:
Mixed integer nonlinear programming tools: a practical overview. 4OR 9(4): 329-349 (2011) - [j4]Claudia D'Ambrosio, Silvano Martello:
Heuristic algorithms for the general nonlinear separable knapsack problem. Comput. Oper. Res. 38(2): 505-513 (2011) - [c4]Claudia D'Ambrosio, Jeff T. Linderoth, James R. Luedtke:
Valid Inequalities for the Pooling Problem with Binary Variables. IPCO 2011: 117-129 - 2010
- [j3]Claudia D'Ambrosio:
Application-oriented mixed integer non-linear programming. 4OR 8(3): 319-322 (2010) - [j2]Claudia D'Ambrosio, Andrea Lodi, Silvano Martello:
Piecewise linear approximation of functions of two variables in MILP models. Oper. Res. Lett. 38(1): 39-46 (2010) - [j1]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
On interval-subgradient and no-good cuts. Oper. Res. Lett. 38(5): 341-345 (2010) - [c3]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. SEA 2010: 350-360
2000 – 2009
- 2009
- [c2]Claudia D'Ambrosio, Jon Lee, Andreas Wächter:
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity. ESA 2009: 107-118 - 2006
- [c1]Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth:
An MINLP Solution Method for a Water Network Problem. ESA 2006: 696-707
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
