Pages that link to "Item:Q3136700"

The following pages link to Une borne optimale pour la programmation entière quasi-convexe (Q3136700):

Displaying 11 items.

• Extensions on ellipsoid bounds for quadratic integer programming (Q721161) (← links)
• New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
• On boundedness of (quasi-)convex integer optimization problems (Q999128) (← links)
• On lower bounds for a class of quadratic 0,1 programs (Q1072937) (← links)
• A quantitative Doignon-Bell-Scarf theorem (Q1743170) (← links)
• A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\) (Q1941539) (← links)
• Integer optimization on convex semialgebraic sets (Q1971505) (← links)
• Complexity of integer quasiconvex polynomial optimization (Q2387421) (← links)
• A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming (Q2883573) (← links)
• (Q3752154) (← links)