Some NP-complete problems in linear programming
type: Item
instance of: scholarly article
title: Some NP-complete problems in linear programming
zbMATH Open document ID: 0506.90052
DOI: 10.1016/0167-6377(82)90006-2
author: R. Chandrasekaran
author: Katta G. Murty
author: Santosh N. Kabadi
published in: Operations Research Letters
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A03
zbMATH DE Number: 3799396
zbMATH Keywords: existence of basic feasible solutions with specified values
zbMATH Keywords: degeneracy testing
zbMATH Keywords: linear dependence
zbMATH Keywords: NP-complete problems
zbMATH Keywords: subset sum problem
zbMATH Keywords: equal partial sums problem
MaRDI profile type: Publication
full work available at URL: 0167-6377(82)90006-2
OpenAlex ID: W2087904554
cites work: Q3229788
cites work: Optimality and Degeneracy in Linear Programming
cites work: Q3844775
cites work: Cycling in the transportation problem
cites work: Cycling in linear complementarity problems
cites work: A note on cycling in the simplex method
cites work: The transhipment problem
cites work: Q5534682
cites work: A Technique for Resolving Degeneracy in Linear Programming
cites work: Q4198056
cites work: Q4142699
cites work: Q4039868
description: scientific article; zbMATH DE number 3799396