Pages that link to "Item:Q5901119"
From MaRDI portal
The following pages link to Generating all vertices of a polyhedron is hard (Q5901119):
Displayed 8 items.
- Parallelization of nullspace algorithm for the computation of metabolic pathways (Q647302) (← links)
- A note on systems with max-min and max-product constraints (Q835215) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes (Q1024731) (← links)
- On enumerating minimal dicuts and strongly connected subgraphs (Q2471808) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization (Q5387795) (← links)
- Exploiting the polyhedral geometry of stochastic linear bilevel programming (Q6086014) (← links)