The DOI matches its Crossref record.
Linear Network Optimization: Algorithms and Codes.
Abstract
Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems. Large-scale optimization is becoming increasingly important for students and professionals in electrical and industrial engineering, computer science, management science and operations research, and applied mathematics. Linear Network Optimization presents a thorough treatment of classical approaches to network problems such as shortest path, max-flow, assignment, transportation, and minimum cost flow problems. It is the first text to clearly explain important recent algorithms such as auction and relaxation, proposed by the author and others for the solution of these problems. Its coverage of both theory and implementations make it particularly useful as a text for a graduate-level course on network optimization as well as a practical guide to state-of-the-art codes in the field. Bertsekas focuses on the algorithms that have proved successful in practice and provides FORTRAN codes that implement them. The presentation is clear, mathematically rigorous, and economical. Many illustrations, examples, and exercises are included in the text. Contents Introduction * Simplex Methods * Dual Ascent Methods * Auction Algorithms * Performance and Comparisons * Appendixes
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
Cited by
Combinatorial Auctions: A Survey
de Vries, S., & Vohra, R. V. (2003) · INFORMS Journal on Computing · doi:10.1287/ijoc.15.3.284.16077 · Cited by 985
Comparison of Multivariate Matching Methods: Structures, Distances, and Algorithms
Gu, X. S., & Rosenbaum, P. R. (1993) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1993.10474623 · Cited by 702
Simulation–Optimization Modeling: A Survey and Potential Application in Reservoir Systems Operation
Rani, D., & Moreira, M. M. (2010) · Water Resources Management · doi:10.1007/s11269-009-9488-0 · Cited by 460
Auction algorithms for network flow problems: A tutorial introduction
Bertsekas, D. P. (1992) · Computational Optimization and Applications · doi:10.1007/bf00247653 · Cited by 421
Self-citationA generalized S-D assignment algorithm for multisensor-multitarget state estimation
Deb, S., Yeddanapudi, M., Pattipati, K., & Bar-Shalom, Y. (1997) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.575891 · Cited by 415
Linear Assignment Problems and Extensions
Burkard, R. E., & Çela, E. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_2 · Cited by 330
Propensity score matching with R: conventional methods and new features
Zhao, Q.-Y., Luo, J.-C., Su, Y., Zhang, Y.-J., Tu, G.-W., & Luo, Z. (2021) · Annals of Translational Medicine · doi:10.21037/atm-20-3998 · Cited by 291
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
Metadata
- Authors
- Wagner, D. K., & Bertsekas, D. P.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1993-04
- Volume
- 60
- Issue
- 202
- Pages
- 872
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W2044973895
- Cited by
- 321
- References
- 0
- FWCI
- 26.60
- 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.