The Lagrangian Relaxation Method for Solving Integer Programming Problems

Fisher, M. L. (1981). The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science, 27(1), 1-18.

Type

Journal article

Intellectual base

Primary research

Year

1981

Volume

27

Issue

1

Pages

1-18

DOI

10.1287/mnsc.27.1.1

DOI registrant

Institute for Operations Research and the Management Sciences

Link

https://doi.org/10.1287/mnsc.27.1.1

Cited from

operations_research

Cited by

2 citations across 2 artifacts.

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

Primes

• Resource Management
  • Listed in the references but not attached to a specific claim.

Mechanisms

• Constraint Relaxation Experiment
  • The formal cousin, Lagrangian relaxation

    This sourceReviews Lagrangian relaxation as moving selected constraints into the objective through multipliers.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:b62b533ab537 · see in the full table