On the complexity of a special basis problem in LP
dc.contributor.author | Murty, Katta G. | en_US |
dc.date.accessioned | 2006-04-10T15:30:14Z | |
dc.date.available | 2006-04-10T15:30:14Z | |
dc.date.issued | 1993-11-30 | en_US |
dc.identifier.citation | Murty, Katta G. (1993/11/30)."On the complexity of a special basis problem in LP." Discrete Applied Mathematics 47(2): 181-185. <http://hdl.handle.net/2027.42/30441> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6TYW-45DB133-X/2/ab72a286f9647974f577f8550732c69f | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/30441 | |
dc.description.abstract | In a linear program (LP) in standard form, we show that the problem of finding a cheapest feasible basic vector among those containing a specified variable as a basic variable, is an NP-hard problem. | en_US |
dc.format.extent | 278463 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | On the complexity of a special basis problem in LP | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI 48109-2117, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/30441/1/0000064.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0166-218X(93)90091-2 | en_US |
dc.identifier.source | Discrete Applied Mathematics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.