On the complexity of four polyhedral set containment problems
Authors:
- 1 November 1985
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 33 (2) , 139-145
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Optimal scaling of balls and polyhedraMathematical Programming, 1982
- Reducibility among Combinatorial Problems1972