Complexity of some parametric integer and network programming problems
- 1 May 1983
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 26 (1), 64-75
- https://doi.org/10.1007/bf02591893
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Computational complexity of parametric linear programmingMathematical Programming, 1980
- Critical Load Factors in Two-Processor Distributed SystemsIEEE Transactions on Software Engineering, 1978
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Aggregation of equations in integer programmingDiscrete Mathematics, 1974
- A bad network problem for the simplex method and other minimum cost flow algorithmsMathematical Programming, 1973
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970