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

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

GLPK (GNU Linear Programming Kit)

· 2012 · Linear Programming and Algorithms for Communication Networks

Abstract

This chapter introduces the software sufficient to solve LP problems. This software is called the GNU linear programming kit (GLPK). It is easy to analytically solve an LP problem with a few decision variables by hand. However, if the number of decision variables increases, the manual approach becomes infeasible. Therefore, a practical tool is required to solve LP problems using computers. Both commercial and free programs have been released to solve LP problems. In this book, the free software, named GLPK, is used as an LP solver.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1201/b12733-5

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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Cited by

See all 174

Metadata

Venue
Linear Programming and Algorithms for Communication Networks
Publisher
CRC Press
Published
2012-08-24
Pages
39-44
OpenAlex
W4255202267
Cited by
174
References
1
FWCI
17.16
Type
book chapter
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

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.