A new polynomial-time algorithm for linear programming.

Karmarkar, N. (1984). A new polynomial-time algorithm for linear programming. Combinatorica, 4(4), 373-395.

Type

Journal article

Intellectual base

Primary research

Year

1984

Link

https://doi.org/10.1007/bf02579150matched

Cited from

operations_research

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Linear Programming (LP)
  • The extensions increase complexity but have been absorbed into standard industry practice.

    This source(Interior-point method; practical polynomial-time LP solution.)

• Resource Management

  • This source(Interior-point method; practical polynomial-time LP solution.)

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:edb8bd5e3b7f · see in the full table