The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Validation of subgradient 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
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV
Roy, H. L. L., Lecam, L., & Neyman, J. (1969) · Revue de l'Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1402306 · Cited by 2,835
Kuhn, H. W., & Tucker, A. W. (1951) · Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability · doi:10.1525/9780520411586-036 · Cited by 1,985
Optimization Theory of Large Systems
Lasdon, L. S., & Tabak, D. (1971) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1971.4308301 · Cited by 1,677
Solution of a Large-Scale Traveling-Salesman Problem
Dantzig, G. B., Fulkerson, R., & Johnson, S. M. (1954) · Journal of the Operations Research Society of America · doi:10.1287/opre.2.4.393 · Cited by 1,483
The Traveling-Salesman Problem and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
Self-citationSolution of a Large-Scale Traveling-Salesman Problem
Chvátal, V., Cook, W. J., Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_1 · Cited by 1,263
The traveling-salesman problem and minimum spanning trees: Part II
Held, M., & Karp, R. M. (1971) · Mathematical Programming · doi:10.1007/bf01584070 · Cited by 1,018
Self-citationThe Relaxation Method for Linear Inequalities
Agmon, S. (1954) · Canadian Journal of Mathematics · doi:10.4153/cjm-1954-037-2 · Cited by 549
Cited by
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
An effective implementation of the Lin–Kernighan traveling salesman heuristic
Helsgaun, K. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00284-2 · Cited by 1,630
Lagrangean relaxation for integer programming
Geoffrion, A. M. (1974) · Mathematical Programming Studies · doi:10.1007/bfb0120690 · Cited by 1,111
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Emergency Logistics Planning in Natural Disasters
Özdamar, L., Ekinci, E., & Küçükyazici, B. (2004) · Annals of Operations Research · doi:10.1023/b:anor.0000030690.27939.39 · Cited by 819
On the placement of Web server replicas
Qiu, L., Padmanabhan, V. N., & Voelker, G. M. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916655 · Cited by 798
Steiner problem in networks: A survey
Winter, P. (1987) · Networks · doi:10.1002/net.3230170203 · Cited by 599
Reserve Requirements for Wind Power Integration: A Scenario-Based Stochastic Programming Framework
Papavasiliou, A., Oren, S. S., & O'Neill, R. P. (2011) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2121095 · Cited by 580
The dynamic berth allocation problem for a container port
Imai, A., Nishimura, E., & Papadimitriou, S. (2001) · Transportation Research Part B: Methodological · doi:10.1016/s0191-2615(99)00057-0 · Cited by 577
Balas, E., & Padberg, M. W. (1976) · SIAM Review · doi:10.1137/1018115 · Cited by 449
Joint UAV Hovering Altitude and Power Control for Space-Air-Ground IoT Networks
Wang, J., Jiang, C., Wei, Z., Pan, C., Zhang, H., & Ren, Y. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2875493 · Cited by 309
Current, J., & Pirkul, H. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90309-j · Cited by 272
Daily imaging scheduling of an earth observation satellite
Lin, W.-C., Liao, D.-Y., Liu, C.-Y., & Lee, Y.-Y. (2005) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2005.843380 · Cited by 173
Walecki, R., Rudovic, O., Pavlovic, V., & Pantic, M. (2015) · 2015 11th IEEE International Conference and Workshops on Automatic Face and Gesture Recognition (FG) · doi:10.1109/fg.2015.7163137 · Cited by 65
Toward Delay-Efficient Game-Aware Data Centers for Cloud Gaming
Amiri, M., Osman, H. A., Shirmohammadi, S., & Abdallah, M. (2016) · ACM Transactions on Multimedia Computing, Communications, and Applications · doi:10.1145/2983639 · Cited by 40
Hybrid Algorithms for Satellite Imaging Scheduling
Lin, W.-C., & Chang, S.-C. (2006) · 2005 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2005.1571527 · Cited by 27
Metadata
- Authors
- Held, M., Wolfe, P., & Crowder, H. P.
- Venue
- Mathematical Programming
- Published
- 1974-12
- Volume
- 6
- Issue
- 1
- Pages
- 62-88
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2017697298
- Cited by
- 1,362
- References
- 13
- FWCI
- 15.46
- 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.