Pages that link to "Item:Q3701197"
From MaRDI portal
The following pages link to Simplex pivots on the set packing polytope (Q3701197):
Displaying 5 items.
- A characterization of the uncapacitated network design polytope (Q1200785) (← links)
- On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation (Q1741477) (← links)
- Adjacency on combinatorial polyhedra (Q1842660) (← links)
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
- Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming (Q6645186) (← links)