The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A Branch-and-Price Algorithm for the Generalized Assignment Problem
Abstract
The generalized assignment problem examines the maximum profit assignment of jobs to agents such that each job is assigned to precisely one agent subject to capacity restrictions on the agents. A new algorithm for the generalized assignment problem is presented that employs both column generation and branch-and-bound to obtain optimal integer solutions to a set partitioning formulation of the problem.
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
Cites
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
A Linear Programming Approach to the Cutting-Stock Problem
Gilmore, P. C., & Gomory, R. E. (1961) · Operations Research · doi:10.1287/opre.9.6.849 · Cited by 2,024
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
Desrochers, M., Desrosiers, J., & Solomon, M. (1992) · Operations Research · doi:10.1287/opre.40.2.342 · Cited by 1,197
Computing Partitions with Applications to the Knapsack Problem
Horowitz, E., & Sahni, S. K. (1974) · Journal of the ACM · doi:10.1145/321812.321823 · Cited by 605
A survey of algorithms for the generalized assignment problem
Cattrysse, D., & Wassenhove, L. N. V. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90077-m · Cited by 411
A Column Generation Approach to the Urban Transit Crew Scheduling Problem
Desrochers, M., & Soumis, F. (1989) · Transportation Science · doi:10.1287/trsc.23.1.1 · Cited by 332
Solving binary cutting stock problems by column generation and branch-and-bound
Vance, P. H., Barnhart, C., Johnson, E. L., & Nemhauser, G. L. (1994) · Computational Optimization and Applications · doi:10.1007/bf01300970 · Cited by 226
Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
Guignard, M., & Rosenwein, M. B. (1989) · Operations Research · doi:10.1287/opre.37.4.658 · Cited by 86
Cited by
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
Self-citationInteger and combinatorial optimization
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91259-2 · Cited by 1,117
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
A comprehensive taxonomy for multi-robot task allocation
Korsah, G. A., Stentz, A., & Dias, M. B. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913496484 · Cited by 652
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
Morrison, D. R., Jacobson, S. H., Sauppe, J. J., & Sewell, E. C. (2016) · Discrete Optimization · doi:10.1016/j.disopt.2016.01.005 · Cited by 563
Metadata
- Authors
- Savelsbergh, M.
- Venue
- Operations Research
- Published
- 1997-12
- Volume
- 45
- Issue
- 6
- Pages
- 831-841
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2059961050
- Cited by
- 437
- References
- 8
- FWCI
- 14.83
- 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.