Exact weighted vertex coloring via branch-and-price
From MaRDI portal
Publication:448972
DOI10.1016/J.DISOPT.2012.03.002zbMATH Open1246.90129DBLPjournals/disopt/FuriniM12OpenAlexW2070420791WikidataQ57659080 ScholiaQ57659080MaRDI QIDQ448972FDOQ448972
Publication date: 11 September 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2012.03.002
Recommendations
- Models and heuristic algorithms for a weighted vertex coloring problem
- An exact approach for the vertex coloring problem
- Iterated local search with tabu search for the weighted vertex coloring problem
- Solving the minimum-weighted coloring problem
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- A survey on vertex coloring problems
- An exact approach for the vertex coloring problem
- A Column Generation Approach for Graph Coloring
- A Heuristic Method for the Set Covering Problem
- Title not available (Why is that?)
- Weighted coloring: further complexity and approximability results
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- The vertex coloring problem and its generalizations
- Models and heuristic algorithms for a weighted vertex coloring problem
- Safe Lower Bounds for Graph Coloring
- Scheduling on a batch machine with job compatibilities
- Time slot scheduling of compatible jobs
Cited In (14)
- Interval scheduling with economies of scale
- On Monte Carlo tree search for weighted vertex coloring
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- Solving the list coloring problem through a branch-and-price algorithm
- A branch-and-price algorithm for the robust graph coloring problem
- Solving vertex coloring problems as maximum weight stable set problems
- Adaptive feasible and infeasible tabu search for weighted vertex coloring
- An exact algorithm for the partition coloring problem
- Models and heuristic algorithms for a weighted vertex coloring problem
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- Iterated local search with tabu search for the weighted vertex coloring problem
- Graph coloring-based approach for railway station design analysis and capacity determination
This page was built for publication: Exact weighted vertex coloring via branch-and-price
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448972)
