The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The ellipsoid method and its consequences in combinatorial optimization
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.
Integrity signals
Registry
Cites
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.
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
Edmonds, J. (1967) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.071b.032 · Cited by 731
Cited by
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
Integer Programming with a Fixed Number of Variables
Lenstra, H. W. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.4.538 · Cited by 1,440
Adjustable robust solutions of uncertain linear programs
Ben-Tal, A., Goryashko, A., Guslitzer, E., & Nemirovski, A. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0454-y · Cited by 1,380
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Submodular functions and convexity
Lovász, L. (1983) · Mathematical Programming The State of the Art · doi:10.1007/978-3-642-68874-4_10 · Cited by 964
Self-citationOn Lovász’ lattice reduction and the nearest lattice point problem
Babai, L. (1986) · Combinatorica · doi:10.1007/bf02579403 · Cited by 938
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Alizadeh, F. (1995) · SIAM Journal on Optimization · doi:10.1137/0805002 · Cited by 892
On the hardness of approximating minimization problems
Lund, C., & Yannakakis, M. (1994) · Journal of the ACM · doi:10.1145/185675.306789 · Cited by 872
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
Malicious Data Attacks on the Smart Grid
Kosut, O., Jia, L., Thomas, R. J., & Tong, L. (2011) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2011.2163807 · Cited by 784
Using Linear Programming to Decode Binary Linear Codes
Feldman, J., Wainwright, M. J., & Karger, D. R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.842696 · Cited by 572
Impact of Interference on Multi-Hop Wireless Network Performance
Jain, K., Padhye, J., Padmanabhan, V. N., & Qiu, L. (2005) · Wireless Networks · doi:10.1007/s11276-005-1769-9 · Cited by 404
Pardalos, P. M., & Xue, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01098364 · Cited by 382
A Linear Programming Approach to Max-Sum Problem: A Review
Werner, T. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1036 · Cited by 342
Knuth, D. E. (1994) · The Electronic Journal of Combinatorics · doi:10.37236/1193 · Cited by 296
An improved LP-based approximation for steiner tree
Byrka, J., Grandoni, F., Rothvoß, T., & Sanità, L. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806769 · Cited by 296
Steiner Tree Approximation via Iterative Randomized Rounding
Byrka, J., Grandoni, F., Rothvoss, T., & Sanità, L. (2013) · Journal of the ACM · doi:10.1145/2432622.2432628 · Cited by 281
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601987570 · Cited by 273
On Quadratization of Pseudo-Boolean Functions
Boros, E., & Gruber, A. (2014) · arXiv · doi:10.48550/arxiv.1404.6538 · Cited by 32
Metadata
- Authors
- Grötschel, M., Lovász, L., & Schrijver, A.
- Venue
- Combinatorica
- Published
- 1981-06
- Volume
- 1
- Issue
- 2
- Pages
- 169-197
- ISSN
- 0209-9683 (ISSN-L)
- 1439-6912
- OpenAlex
- W2012329067
- Cited by
- 2,011
- References
- 1
- FWCI
- 46.61
- 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
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.
