Undecidability and hardness in mixed-integer nonlinear programming

DOI10.1051/RO/2018036MaRDI QIDQ5380962zbMATH OpenOpenAlexWikidataFDO

Authors Leo Liberti

Publication date 7 June 2019

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2018036

zbMATH Keywords

mathematical programminghardnessundecidability

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Mixed integer programming (90C11)

Recommendations

• On the complexity of nonlinear mixed-integer optimization
• Mixed-integer quadratic programming is in NP
• Mixed-integer nonlinear optimization
• Mixed integer nonlinear programming tools: a practical overview
• Mixed integer nonlinear programming tools: an updated practical overview

Cited in

(11)

• Maximum feasible subsystems of distance geometry constraints
• Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
• Complexity of linear relaxations in integer programming
• The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
• Pyomo.GDP: an ecosystem for logic based modeling and optimization development
• Distance geometry and data science
• A distributional framework for evaluation, comparison and uncertainty quantification in soft clustering
• On the complexity of nonlinear mixed-integer optimization
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
• Mixed-integer quadratic programming is in NP
• The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs

This page was built for publication: Undecidability and hardness in mixed-integer nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380962)