Extreme point Quadratic Minimization Problem

DOI10.1080/02522667.1993.10699137zbMath0792.90054OpenAlexW2139802033MaRDI QIDQ4272558

Renu Gupta, Munish C. Puri

Publication date: 6 December 1993

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1993.10699137

zbMATH Keywords

convex polytopezero-one integer quadratic programs

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Boolean programming (90C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding all vertices of a convex polyhedron
• Extreme point programming with nonlinear constraints
• A versatile scheme for ranking the extreme points of an assignment polytope
• A Node Method for Multiparametric Linear Programming
• Technical Note—Vertex Generation and Cardinality Constrained Linear Programs
• Adjacent vertices on transportation polytopes
• Determining adjacent vertices on assignment polytopes
• An algorithm for determining all extreme points of a convex polytope
• Concave minimization over a convex polyhedron
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

This page was built for publication: Extreme point Quadratic Minimization Problem