Pages that link to "Item:Q5380962"
From MaRDI portal
The following pages link to Undecidability and hardness in mixed-integer nonlinear programming (Q5380962):
Displaying 10 items.
- Mixed-integer quadratic programming is in NP (Q517303) (← links)
- The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs (Q1849260) (← links)
- Maximum feasible subsystems of distance geometry constraints (Q2131137) (← links)
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities (Q2136869) (← links)
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Distance geometry and data science (Q2192022) (← links)
- A distributional framework for evaluation, comparison and uncertainty quantification in soft clustering (Q6066842) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)