The following pages link to (Q4719331):
Displaying 18 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)
- Enumerating regular mixed-cell configurations (Q1293676) (← links)
- A note on hyperplane generation (Q1328388) (← 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)
- A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search (Q4605440) (← links)
- Hyperplane Arrangements in polymake (Q5041056) (← links)
- Output-sensitive cell enumeration in hyperplane arrangements (Q5054865) (← 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)
