The DOI matches its Crossref record.
Combinatorial Optimization: Algorithms and Complexity.
Abstract
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more. All chapters are supplemented by thoughtprovoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. Mathematicians wishing a self-contained introduction need look no further.—American Mathematical Monthly. 1982 ed.
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.
Integrity signals
Registry
Cites
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.
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
Cited by
Items 101–135 of 135
From Machine Learning to Explainable AI
Holzinger, A. (2018) · 2018 World Symposium on Digital Intelligence for Systems and Machines (DISA) · doi:10.1109/disa.2018.8490530 · Cited by 306
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
Lin, X., & Shroff, N. B. (2006) · doi:10.1109/tent.2006.872546 · Cited by 306
Closure-Tree: An Index Structure for Graph Queries
He, H., & Singh, A. K. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.37 · Cited by 293
Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
Singh, R., Xu, J., & Berger, B. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71681-5_2 · Cited by 286
The Tractable Cognition Thesis
Van Rooij, I. (2008) · Cognitive Science · doi:10.1080/03640210801897856 · Cited by 285
A Local Learning Approach for Clustering
Wu, M., & Schölkopf, B. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0196 · Cited by 284
Stable marriage and indifference
Irving, R. W. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)00179-p · Cited by 283
Optimizing the "one big switch" abstraction in software-defined networks
Kang, N., Liu, Z., Rexford, J., & Walker, D. (2013) · Proceedings of the ninth ACM conference on Emerging networking experiments and technologies · doi:10.1145/2535372.2535373 · Cited by 282
A new relaxation algorithm and passive sensor data association
Pattipati, K. R., Deb, S., Bar-Shalom, Y., & Washburn, R. B. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.121621 · Cited by 280
Compressive Phase Retrieval via Generalized Approximate Message Passing
Schniter, P., & Rangan, S. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2386294 · Cited by 279
Sinop, A. K., & Grady, L. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408927 · Cited by 277
On max-min fairness and scheduling in wireless ad-hoc networks
Huang, X. L., & Bensaou, B. (2001) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/501445.501447 · Cited by 276
Capacitated clustering problems by hybrid simulated annealing and tabu search
Osman, I. (1994) · International Transactions in Operational Research · doi:10.1016/0969-6016(94)90032-9 · Cited by 274
A Survey on Task Offloading in Multi-access Edge Computing
Islam, A., Debnath, A., Ghose, M., & Chakraborty, S. (2021) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2021.102225 · Cited by 271
FSA-based link assignment and routing in low-earth orbit satellite networks
Chang, H. S., Kim, B. W., Lee, C. G., Min, S. L., Choi, Y., Yang, H. S., Kim, D. N., & Kim, C. S. (1998) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.704858 · Cited by 269
An orthogonal genetic algorithm for multimedia multicast routing
Zhang, Q., & Leung, Y.-W. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.752920 · Cited by 269
Hornik, K. (2005) · Journal of Statistical Software · doi:10.18637/jss.v014.i12 · Cited by 268
Shortest Path Algorithms In Transportation Models: Classical and Innovative Aspects
Pallottino, S., & Scutellà, M. G. (1998) · Equilibrium and Advanced Transportation Modelling · doi:10.1007/978-1-4615-5757-9_11 · Cited by 267
Pierce, N. A., & Winfree, E. (2002) · Protein Engineering, Design and Selection · doi:10.1093/protein/15.10.779 · Cited by 267
Scalable parallel data mining for association rules
Han, E.-H., Karypis, G., & Kumar, V. (1997) · Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97 · doi:10.1145/253260.253330 · Cited by 262
Active set algorithms for isotonic regression; A unifying framework
Best, M. J., & Chakravarti, N. (1990) · Mathematical Programming · doi:10.1007/bf01580873 · Cited by 262
Neutrino-“pasta” scattering: The opacity of nonuniform neutron-rich matter
Horowitz, C. J., Pérez-García, M. A., & Piekarewicz, J. (2004) · Physical Review C · doi:10.1103/physrevc.69.045804 · Cited by 259
The zero/one multiple knapsack problem and genetic algorithms
Khuri, S., Bäck, T., & Heitkötter, J. (1994) · Proceedings of the 1994 ACM symposium on Applied computing - SAC '94 · doi:10.1145/326619.326694 · Cited by 259
Large-scale Ising spin network based on degenerate optical parametric oscillators
Inagaki, T., Inaba, K., Hamerly, R., Inoue, K., Yamamoto, Y., & Takesue, H. (2016) · Nature Photonics · doi:10.1038/nphoton.2016.68 · Cited by 258
An Exact Distribution-Free Test Comparing Two Multivariate Distributions based on Adjacency
Rosenbaum, P. R. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00513.x · Cited by 255
Propensity Score Matching with Time‐Dependent Covariates
Lu, B. (2005) · Biometrics · doi:10.1111/j.1541-0420.2005.00356.x · Cited by 253
Optimal search on a technology landscape
Kauffman, S., Lobo, J., & Macready, W. G. (2000) · Journal of Economic Behavior & Organization · doi:10.1016/s0167-2681(00)00114-1 · Cited by 253
Thek-server dual and loose competitiveness for paging
Young, N. (1994) · Algorithmica · doi:10.1007/bf01189992 · Cited by 252
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
Energy Minimization via Graph Cuts: Settling What is Possible
Freedman, D., & Drineas, P. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.143 · Cited by 173
Generalized extreme learning machine autoencoder and a new deep neural network
Sun, K., Zhang, J., Zhang, C., & Hu, J. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.12.027 · Cited by 154
Loop closure detection in SLAM by combining visual and spatial appearance
Ho, K. L., & Newman, P. (2006) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2006.04.016 · Cited by 93
Feedback-Based Quantum Optimization
Magann, A. B., Rudinger, K. M., Grace, M. D., & Sarovar, M. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.250502 · Cited by 67
A Framework for Outlier Description Using Constraint Programming
Kuo, C.-T., & Davidson, I. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10174 · Cited by 18
2022 roadmap on neuromorphic computing and engineering
Christensen, D. V., Dittmann, R., Linares-Barranco, B., Sebastian, A., Le Gallo, M., Redaelli, A., Slesazeck, S., Mikolajick, T., Spiga, S., Menzel, S., et al. (2022) · Neuromorphic Computing and Engineering · doi:10.1088/2634-4386/ac4a83
Metadata
- Authors
- Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K.
- Venue
- The American Mathematical Monthly
- Publisher
- JSTOR
- Published
- 1984-03
- Volume
- 91
- Issue
- 3
- Pages
- 209
- ISSN
- 0002-9890 (ISSN-L)
- OpenAlex
- W2053913299
- Cited by
- 5,942
- References
- 0
- FWCI
- 63.72
- 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.