On the complexity of a special basis problem in LP

DOI10.1016/0166-218X(93)90091-2zbMath0802.90071OpenAlexW2001137340MaRDI QIDQ1315997

Katta G. Murty

Publication date: 17 April 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90091-2

zbMATH Keywords

NP-hardbalanced transportation modelcheapest feasible basic vector

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Cites Work

• A fundamental problem in linear inequalities with applications to the travelling salesman problem
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of a special basis problem in LP