Combinatorial optimization and small polytopes
- 1 June 1996
- journal article
- Published by Springer Nature in TOP
- Vol. 4 (1) , 1-53
- https://doi.org/10.1007/bf02568602
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Lectures on PolytopesPublished by Springer Nature ,1995
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedraDiscrete & Computational Geometry, 1992
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991
- Small Travelling Salesman PolytopesMathematics of Operations Research, 1991
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalitiesUSSR Computational Mathematics and Mathematical Physics, 1965
- Über homogene lineare UngleichungssystemeZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1956