Pages that link to "Item:Q517303"

The following pages link to Mixed-integer quadratic programming is in NP (Q517303):

Displaying 21 items.

• On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
• Ellipsoidal mixed-integer representability (Q1801008) (← links)
• Proximity in concave integer quadratic programming (Q2149572) (← links)
• Termination of polynomial loops (Q2233526) (← links)
• Characterizations of mixed binary convex quadratic representable sets (Q2316624) (← links)
• Scheduling for a processor sharing system with linear slowdown (Q2408895) (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
• Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane (Q2806816) (← links)
• On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
• On the Mixed Binary Representability of Ellipsoidal Regions (Q3186504) (← links)
• Simple Strategies in Multi-Objective MDPs (Q5039517) (← links)
• Mixed-Integer Convex Representability (Q5076722) (← links)
• Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
• Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming (Q5853719) (← links)
• Long-Run Average Behavior of Vector Addition Systems with States (Q5875389) (← links)
• Complexity, exactness, and rationality in polynomial optimization (Q5918421) (← links)
• Complexity, exactness, and rationality in polynomial optimization (Q5925641) (← links)
• Phragmén's voting methods and justified representation (Q6120935) (← links)
• Complexity of optimizing over the integers (Q6160281) (← links)
• An approximation algorithm for indefinite mixed integer quadratic programming (Q6165586) (← links)
• Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications (Q6180277) (← links)