Claudia D'Ambrosio

Antonio Frangioni

Claudio Gentile

Oper. Res. Lett., November, 2023

Urban air mobility: from complex tactical conflict resolution to network design and fairness insights.

[BibT_eX]

[DOI]

Optim. Methods Softw., November, 2023

Optimal deployment of indoor wireless local area networks.

[BibT_eX]

[DOI]

Networks, January, 2023

Branch and price for submodular bin packing.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., January, 2023

Optimal Battery Charge Scheduling For Revenue Stacking Under Operational Constraints Via Energy Arbitrage.

[BibT_eX]

[DOI]

Alban Puech

Gorazd Dimitrov

Proceedings of the IEEE PES Innovative Smart Grid Technologies Europe, 2023

2022

Aircraft Deconfliction via Mathematical Programming: Review and Insights.

[BibT_eX]

[DOI]

Mercedes Pelegrín

Transp. Sci., 2022

Convergent Algorithms for a Class of Convex Semi-infinite Programs.

[BibT_eX]

[DOI]

SIAM J. Optim., 2022

2021

Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice.

[BibT_eX]

[DOI]

J. Glob. Optim., 2021

Detecting and solving aircraft conflicts using bilevel programming.

[BibT_eX]

[DOI]

J. Glob. Optim., 2021

Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley.

[BibT_eX]

[DOI]

Wim van Ackooij

Dimitri Thomopulos

Renan Spencer Trindade

Eur. J. Oper. Res., 2021

2020

Strong Convex Nonlinear Relaxations of the Pooling Problem.

[BibT_eX]

[DOI]

SIAM J. Optim., 2020

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

[BibT_eX]

[DOI]

Optim. Lett., 2020

Random projections for quadratic programs.

[BibT_eX]

[DOI]

Math. Program., 2020

Algorithms and applications for a class of bilevel MILPs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Lower and upper bounds for the non-linear generalized assignment problem.

[BibT_eX]

[DOI]

Michele Monaci

Comput. Oper. Res., 2020

A Learning-Based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning, Optimization, and Data Science, 2020

Learning to Configure Mathematical Programming Solvers by Mathematical Programming.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

Handling Separable Non-convexities Using Disjunctive Cuts.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Strengthening the sequential convex MINLP technique by perspective reformulations.

[BibT_eX]

[DOI]

Antonio Frangioni

Claudio Gentile

Optim. Lett., 2019

Complex portfolio selection via convex mixed-integer quadratic programming: a survey.

[BibT_eX]

[DOI]

Luca Mencarelli

Int. Trans. Oper. Res., 2019

On the Observability of Smart Grids and Related Optimization Methods.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2019, 2019

Random Projections for Quadratic Programs over a Euclidean Ball.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

On the Product Knapsack Problem.

[BibT_eX]

[DOI]

Optim. Lett., 2018

Feasibility pump for aircraft deconfliction with speed regulation.

[BibT_eX]

[DOI]

Sonia Cafieri

J. Glob. Optim., 2018

Complexity and inapproximability results for the Power Edge Set problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Shortest Path Problem variants for the Hydro Unit Commitment Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Relaxations and heuristics for the multiple non-linear separable knapsack problem.

[BibT_eX]

[DOI]

Luca Mencarelli

Comput. Oper. Res., 2018

Maximum Concurrent Flow with Incomplete Data.

[BibT_eX]

[DOI]

Pierre-Olivier Bauguion

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017

MILP models for the selection of a small set of well-distributed points.

[BibT_eX]

[DOI]

Giacomo Nannicini

Giorgio Sartor

Oper. Res. Lett., 2017

Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization.

[BibT_eX]

[DOI]

Christoph Buchheim

J. Glob. Optim., 2017

Surrogate-based methods for black-box optimization.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2017

A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs.

[BibT_eX]

[DOI]

Valentina Cacchiani

Eur. J. Oper. Res., 2017

Special issue on: Nonlinear and combinatorial methods for energy optimization.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2017

New Error Measures and Methods for Realizing Protein Graphs from Distance Data.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

The Isomap Algorithm in Distance Geometry.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Distance Geometry in Linearizable Norms.

[BibT_eX]

[DOI]

Proceedings of the Geometric Science of Information - Third International Conference, 2017

2016

The power edge set problem.

[BibT_eX]

[DOI]

Networks, 2016

Heuristics for the General Multiple Non-linear Knapsack Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Controlling the Average Behavior of Business Rules Programs.

[BibT_eX]

[DOI]

Olivier Wang

Christian de Sainte Marie

Changhai Ke

Proceedings of the Rule Technologies. Research, Tools, and Applications, 2016

2015

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

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Mathematical programming techniques in water network optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Observing the State of a Smart Grid Using Bilevel Programming.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Graphsj 3: a Modern Didactic Application for Graph Algorithms.

[BibT_eX]

[DOI]

Gianluca Costa

J. Comput. Sci., 2014

Optimistic MILP modeling of non-linear optimization problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Box-Constrained Mixed-Integer Polynomial Optimization Using Separable Underestimators.

[BibT_eX]

[DOI]

Christoph Buchheim

Proceedings of the Integer Programming and Combinatorial Optimization, 2014

2013

Mixed integer nonlinear programming tools: an updated practical overview.

[BibT_eX]

[DOI]

Andrea Lodi

Ann. Oper. Res., 2013

2012

A storm of feasibility pumps for nonconvex MINLP.

[BibT_eX]

[DOI]

Math. Program., 2012

2011

Heuristic algorithms for the general nonlinear separable knapsack problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2011

Mixed integer nonlinear programming tools: a practical overview.

[BibT_eX]

[DOI]

Andrea Lodi

4OR, 2011

Valid Inequalities for the Pooling Problem with Binary Variables.

[BibT_eX]

[DOI]

Jeff T. Linderoth

James R. Luedtke

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Piecewise linear approximation of functions of two variables in MILP models.

[BibT_eX]

[DOI]

Andrea Lodi

Oper. Res. Lett., 2010

On interval-subgradient and no-good cuts.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Application-oriented mixed integer non-linear programming.

[BibT_eX]

[DOI]

4OR, 2010

Experiments with a Feasibility Pump Approach for Nonconvex MINLPs.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009

A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity.

[BibT_eX]

[DOI]