mlsanityData to 7 Oct 2026

Enhancing Column Generation by a Machine-Learning-Based Pricing Heuristic for Graph Coloring

arXiv 2112.04906 ↗First posted 8 Dec 2021math.OC cs.AI cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

Column Generation (CG) is an effective method for solving large-scale optimization problems. CG starts by solving a sub-problem with a subset of columns (i.e., variables) and gradually includes new columns that can improve the solution of the current subproblem. The new columns are generated as needed by repeatedly solving a pricing problem, which is often NP-hard and is a bottleneck of the CG approach. To tackle this, we propose a Machine-Learning-based Pricing Heuristic (MLPH)that can generate many high-quality columns efficiently. In each iteration of CG, our MLPH leverages an ML model to predict the optimal solution of the pricing problem, which is then used to guide a sampling method to efficiently generate multiple high-quality columns. Using the graph coloring problem, we empirically show that MLPH significantly enhancesCG as compared to six state-of-the-art methods, and the improvement in CG can lead to substantially better performance of the branch-and-price exact method.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 7 of its 43 references that are in the map. First posted on arXiv 8 Dec 2021.

Builds on

7 of 43 references.

References · 7

  1. 2018Attention, Learn to Solve Routing Problems!cited by 646
  2. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
  3. 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
  4. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 313
  5. 2018Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Searchcited by 182
  6. 2020Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman Problemscited by 17
  7. 2013DASH: Dynamic Approach for Switching Heuristicscited by 13

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 5; 2025: 2; 2026: 2.

12 papers.