The DOI matches its Crossref record.
Assignment Problems
Open accessAbstract
This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organized the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly. Exercises in the form of numerical examples provide readers with a method of self-study or students with homework problems, and an associated web page ( www.siam.org/books/ot106/assignmentproblems.html) offers applets that readers can use to execute some of the basic algorithms as well as links to computer codes that are available online. \n \nTable of contents \nPreface; \nChapter 1: Introduction; \nChapter 2: Theoretical Foundations; \nChapter 3: Bipartite Matching Algorithms; \nChapter 4: Linear Sum Assignment Problem; \nChapter 5: Further Results on the Linear Sum Assignment Problem; \nChapter 6: Other Types of Linear Assignment Problems; \nChapter 7: Quadratic Assignment Problems: Formulations and Bounds; \nChapter 8: Quadratic Assignment Problems: Algorithms; \nChapter 9: Other Types of Quadratic Assignment Problems; \nChapter 10: Multi-index Assignment Problems; \nBibliography; \nAuthor Index; \nSubject Index \n \nFor more information please check \nhttp://www.ec-securehost.com/SIAM/OT106.html
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
Convolutional wasserstein distances: efficient optimal transportation on geometric domains
Solomon, J., de Goes, F., Peyré, G., Cuturi, M., Butscher, A., Nguyen, A., Du, T., & Guibas, L. (2015) · ACM Transactions on Graphics · doi:10.1145/2766963 · Cited by 481
Probabilistic graph and hypergraph matching
Zass, R., & Shashua, A. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587500 · Cited by 369
Scaling algorithms for unbalanced optimal transport problems
Chizat, L., Peyré, G., Schmitzer, B., & Vialard, F.-X. (2018) · Mathematics of Computation · doi:10.1090/mcom/3303 · Cited by 336
Trajectory Planning for Quadrotor Swarms
Honig, W., Preiss, J. A., Kumar, T. K. S., Sukhatme, G. S., & Ayanian, N. (2018) · IEEE Transactions on Robotics · doi:10.1109/tro.2018.2853613 · Cited by 315
Deep generative Bayesian optimization for sensor placement in structural health monitoring
Sajedi, S., & Liang, X. (2022) · Computer-Aided Civil and Infrastructure Engineering · doi:10.1111/mice.12799 · Cited by 68
Metadata
- Authors
- Burkard, R., Dell'Amico, M., & Martello, S.
- Venue
- Society for Industrial and Applied Mathematics eBooks
- Published
- 2009-01
- OpenAlex
- W2467020497
- Cited by
- 1,394
- References
- 0
- FWCI
- 41.25
- Type
- book
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Assignment Problems. https://app.cochat.ai/papers/10.1137/1.9780898717754
- The paper
- Burkard, R., Dell'Amico, M., & Martello, S. (2009). Assignment Problems. Society for Industrial and Applied Mathematics eBooks. https://doi.org/10.1137/1.9780898717754
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.
