Pages that link to "Item:Q4077720"
From MaRDI portal
The following pages link to Technical Note—Vertex Generation and Cardinality Constrained Linear Programs (Q4077720):
Displaying 9 items.
- Membership functions, some mathematical programming models and production scheduling (Q1165156) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- Automatic Editing for Business Surveys: An Assessment of Selected Algorithms (Q3421327) (← links)
- An algorithm for determining all extreme points of a convex polytope (Q4159164) (← links)
- A continuous variable representation of the traveling salesman problem (Q4168793) (← links)
- Extreme point Quadratic Minimization Problem (Q4272558) (← links)
- A LIBRARY FOR DOING POLYHEDRAL OPERATIONS (Q4526928) (← links)
- A method of transferring polyhedron between the intersection-form and the sum-form (Q5948790) (← links)
