Extreme point Quadratic Minimization Problem
From MaRDI portal
Recommendations
Cites work
- A Node Method for Multiparametric Linear Programming
- A versatile scheme for ranking the extreme points of an assignment polytope
- Adjacent vertices on transportation polytopes
- An algorithm for determining all extreme points of a convex polytope
- Concave minimization over a convex polyhedron
- Determining adjacent vertices on assignment polytopes
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Extreme point programming with nonlinear constraints
- Finding all vertices of a convex polyhedron
- scientific article; zbMATH DE number 3523317 (Why is no real title available?)
- scientific article; zbMATH DE number 3543799 (Why is no real title available?)
- scientific article; zbMATH DE number 3604670 (Why is no real title available?)
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Technical Note—Vertex Generation and Cardinality Constrained Linear Programs
Cited in
(2)
This page was built for publication: Extreme point Quadratic Minimization Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4272558)