The following pages link to (Q3081841):
Displaying 13 items.
- The polyhedral Lagrange principle (Q642053) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- Solution of polyhedra (Q1762916) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- A comprehensive analysis of polyhedral lift-and-project methods (Q2790405) (← links)
- Counterexample-Guided Refinement of Template Polyhedra (Q3303915) (← links)
- Sinc Methods on Polyhedra (Q3382744) (← links)
- polymake: a framework for analyzing convex polytopes (Q4518980) (← links)
- (Q4763415) (← links)
- Geometric Pólya-Aeppli process (Q5086536) (← links)
- Fast polyhedra abstract domain (Q5370845) (← links)
- DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES (Q5426828) (← links)
- An efficient abstract domain for not necessarily closed polyhedra (Q6041169) (← links)
