Pages that link to "Item:Q999128"
From MaRDI portal
The following pages link to On boundedness of (quasi-)convex integer optimization problems (Q999128):
Displaying 17 items.
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- Unboundedness in reverse convex and concave integer programming (Q604803) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- Conditions for boundedness in concave programming under reverse convex and convex constraints (Q1006541) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- The relationship between integer and real solutions of constrained convex programming (Q1176807) (← links)
- Integer optimization on convex semialgebraic sets (Q1971505) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- Minimal infeasible constraint sets in convex integer programs (Q2268936) (← links)
- Complexity of integer quasiconvex polynomial optimization (Q2387421) (← links)
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes (Q2506181) (← links)
- Une borne optimale pour la programmation entière quasi-convexe (Q3136700) (← links)
- On checking unboundedness of functions (Q3987194) (← links)
- (Q4301454) (← links)
- On the integrality gap of binary integer programs with Gaussian data (Q5918435) (← links)
- On the relationship between the integer and continuous solutions of convex programs (Q5949923) (← links)
