The following pages link to (Q4719331):
Displaying 14 items.
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- Reachability determination in acyclic Petri nets by cell enumeration approach (Q644287) (← links)
- On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
- Cell-and-bound algorithm for chance constrained programs with discrete distributions (Q1753452) (← links)
- A polynomial case of the cardinality-constrained quadratic optimization problem (Q2393087) (← links)
- Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane (Q2806816) (← links)
- Hyperplane Arrangements in polymake (Q5041056) (← links)
- A class of optimization problems motivated by rank estimators in robust regression (Q5093682) (← links)
- Partial identification in nonseparable binary response models with endogenous regressors (Q6108266) (← links)
- Computing characteristic polynomials of hyperplane arrangements with symmetries (Q6142348) (← links)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)
