The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
A Column Generation Approach for Graph Coloring
Abstract
We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for each independent set in the graph). We use a column generation method for implicit optimization of the linear program at each node of the branch-and-bound tree. This approach, while requiring the solution of a difficult subproblem as well as needing sophisticated branching rules, solves small to moderate size problems quickly. We have also implemented an exact graph coloring algorithm based on DSATUR for comparison. Implementation details and computational experience are presented.
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
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
New methods to color the vertices of a graph
Brélaz, D. (1979) · Communications of the ACM · doi:10.1145/359094.359101 · Cited by 1,567
Stanford GraphBase: A Platform for Combinatorial Computing, The
Knuth, D. E. (1993) · Cited by 927
Vertex packings: Structural properties and algorithms
Nemhauser, G. L., & Trotter, L. E. (1975) · Mathematical Programming · doi:10.1007/bf01580444 · Cited by 664
Large Cliques Elude the Metropolis Process
Jerrum, M. (1992) · Random Structures & Algorithms · doi:10.1002/rsa.3240030402 · Cited by 312
Finding a Maximum Clique in an Arbitrary Graph
Balas, E., & Yu, C. S. (1986) · SIAM Journal on Computing · doi:10.1137/0215075 · Cited by 295
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
Register allocation by priority-based coloring
Chow, F., & Hennessy, J. (1984) · Proceedings of the 1984 SIGPLAN symposium on Compiler construction - SIGPLAN '84 · doi:10.1145/502874.502896 · Cited by 220
Constrained graph partitioning: decomposition, polyhedral structure and algorithms
Mehrotra, A. (1992) · SMARTech Repository (Georgia Institute of Technology) · Cited by 14
Self-citation
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
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
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
Models and solution techniques for frequency assignment problems
Aardal, K. I., van Hoesel, S. P. M., Koster, A. M. C. A., Mannino, C., & Sassano, A. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0178-0 · Cited by 339
A technical review of column generation in integer programming
Wilhelm, W. E. (2001) · Optimization and Engineering · doi:10.1023/a:1013141227104 · Cited by 108
Metadata
- Authors
- Mehrotra, A., & Trick, M. A.
- Venue
- INFORMS Journal on Computing
- Published
- 1996-11
- Volume
- 8
- Issue
- 4
- Pages
- 344-354
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2013946649
- Cited by
- 410
- References
- 9
- FWCI
- 7.21
- 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.