Technical Note—Vertex Generation and Cardinality Constrained Linear Programs

DOI10.1287/OPRE.23.3.555zbMATH Open0316.90038OpenAlexW2151882889MaRDI QIDQ4077720FDOQ4077720

Authors: David S. Rubin 

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

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (9)

• Extreme point Quadratic Minimization Problem
• A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
• A continuous variable representation of the traveling salesman problem
• A method of transferring polyhedron between the intersection-form and the sum-form
• Membership functions, some mathematical programming models and production scheduling
• Automatic Editing for Business Surveys: An Assessment of Selected Algorithms
• Efficient enumeration of the vertices of polyhedra associated with network LP's
• Combinatorial optimization and small polytopes
• An algorithm for determining all extreme points of a convex polytope

This page was built for publication: Technical Note—Vertex Generation and Cardinality Constrained Linear Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077720)