Pages that link to "Item:Q2436643"
From MaRDI portal
The following pages link to Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643):
Displaying 11 items.
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- Quadratic programs with hollows (Q1659682) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- Robust combinatorial optimization with variable budgeted uncertainty (Q1942010) (← links)
- Valid inequalities for quadratic optimisation with domain constraints (Q2234747) (← links)
- On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- Closedness of Integer Hulls of Simple Conic Sets (Q3462546) (← links)
- Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)
