Undecidability and hardness in mixed-integer nonlinear programming

DOI10.1051/RO/2018036zbMATH Open1414.90237OpenAlexW2802655332WikidataQ129869183 ScholiaQ129869183MaRDI QIDQ5380962FDOQ5380962

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)

Cited In (7)

• 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
• 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
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones

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)