Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 257

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Pivot and Complement–A Heuristic for 0-1 Programming

Balas, Egon, Martin, Clarence H.·1980·Management Science

Abstract

Pivot and Complement is a heuristic for finding approximate solutions to 0-1 programming problems. It uses the fact that a 0-1 program is equivalent to the associated linear program with the added requirement that all slack variables, other than those in the upper bounding constraints, be basic. The procedure starts by solving the linear program; then performs a sequence of pivots aimed at putting all slacks into the basis at a minimal cost; finally, it attempts to improve the 0-1 solution obtained in this way by a local search based on complementing certain sets of 0-1 variables. The computational effort involved in the procedure is bounded by a polynomial in the number of constraints and variables. For the 92 test problems with 5 to 200 constraints and 20 to 900 variables on which the procedure was run, the time used to solve the linear program on the average considerably exceeded the time used for everything else. As to the quality of the solutions obtained, in 45 cases, or 49% of the total, the procedure found an optimal solution; for the capital budgeting problems (positive coefficients everywhere), the solution found was on the average within 0.15% of the optimum; for 81 of the 92 problems, it was within 1% of the optimum; and only in 1 case did the procedure not find a feasible solution.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1287/mnsc.26.1.86

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 257

Metadata

Authors
Balas, E., & Martin, C. H.
Venue
Management Science
Published
1980-01
Volume
26
Issue
1
Pages
86-96
ISSN
  • 0025-1909 (ISSN-L)
  • 1526-5501
OpenAlex
W2026106837
Cited by
257
References
1
FWCI
2.25
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Pivot and Complement–A Heuristic for 0-1 Programming. https://app.cochat.ai/papers/10.1287/mnsc.26.1.86
The paper
Balas, E., & Martin, C. H. (1980). Pivot and Complement–A Heuristic for 0-1 Programming. Management Science. https://doi.org/10.1287/mnsc.26.1.86

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.