On the acyclic subgraph polytope
- 1 September 1985
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 33 (1) , 28-42
- https://doi.org/10.1007/bf01582009
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- Optimal triangulation of large real world input-output matricesStatistische Hefte, 1983
- A branch and bound algorithm for the acyclic subgraph problemEuropean Journal of Operational Research, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- A Minimax Theorem for Directed GraphsJournal of the London Mathematical Society, 1978