Technical Note—Vertex Generation and Cardinality Constrained Linear Programs
From MaRDI portal
Publication:4077720
DOI10.1287/opre.23.3.555zbMath0316.90038OpenAlexW2151882889MaRDI QIDQ4077720
Publication date: 1975
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.23.3.555
Related Items
A LIBRARY FOR DOING POLYHEDRAL OPERATIONS, Extreme point Quadratic Minimization Problem, Membership functions, some mathematical programming models and production scheduling, A method of transferring polyhedron between the intersection-form and the sum-form, An algorithm for determining all extreme points of a convex polytope, A continuous variable representation of the traveling salesman problem, Combinatorial optimization and small polytopes, Automatic Editing for Business Surveys: An Assessment of Selected Algorithms, Efficient enumeration of the vertices of polyhedra associated with network LP's
