A Column Generation Approach for Graph Coloring
From MaRDI portal
Recommendations
- Exact solution of graph coloring problems via constraint programming and column generation
- A Branch-And-Price Approach for Graph Multi-Coloring
- A branch-and-cut algorithm for graph coloring
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- Maximum-weight stable sets and safe lower bounds for graph coloring
Cited in
(only showing first 100 items - show all)- Iterative coloring extension of a maximum clique
- A cutting plane algorithm for graph coloring
- A branch-and-cut algorithm for graph coloring
- Branch-and-cut-and-price algorithms for the preemptive RCPSP
- Graph coloring using GPUs
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- Cliques and clustering: A combinatorial approach
- Directed weighted improper coloring for cellular channel allocation
- Constraint programming-based column generation
- A near-optimal optimization algorithm for link assignment in wireless ad-hoc networks
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A survey on vertex coloring problems
- Efficient algorithms for finding critical subgraphs
- On the asymmetric representatives formulation for the vertex coloring problem
- The general \(\alpha \)-decomposition problem of fuzzy relations
- Graph coloring problem solving using Monte Carlo tree search and deep reinforcement learning
- A new approach to the vertex coloring problem
- scientific article; zbMATH DE number 434500 (Why is no real title available?)
- A comparison of integer programming models for the partial directed weighted improper coloring problem
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- The vehicle routing problem with floating targets: formulation and solution approaches
- An inexact bundle variant suited to column generation
- A column generation based algorithm for the robust graph coloring problem
- A branch-and-price algorithm for the minimum sum coloring problem
- On the queen graphs coloring problem.
- Comparison of column generation models for channel assignment in cellular networks
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A network-flow-based lower bound for the minimum weighted integer coloring problem
- A Pruning Procedure for Exact Graph Coloring
- An incremental search heuristic for coloring vertices of a graph
- Enhancing CP-based column generation for integer programs
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- Constraint and satisfiability reasoning for graph coloring
- A one-to-one correspondence between colorings and stable sets
- Graph coloring lower bounds from decision diagrams
- Expected polynomial-time randomized algorithm for graph coloring problem
- Fractional programming formulation for the vertex coloring problem
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Generalised graph colouring by a hybrid of local search and constraint programming
- An exact method for graph coloring
- Exact solution of graph coloring problems via constraint programming and column generation
- A set packing model for the partition coloring problem
- Solving the minimum-weighted coloring problem
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- A Wide Branching Strategy for the Graph Coloring Problem
- Solving a multicoloring problem with overlaps using integer programming
- Interval scheduling with economies of scale
- A simple branching scheme for vertex coloring problems
- Adaptive solution prediction for combinatorial optimization
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- On the application of graph colouring techniques in round-robin sports scheduling
- A new branch-and-bound algorithm for the maximum weighted clique problem
- Graph coloring with decision diagrams
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Cliques, holes and the vertex coloring polytope
- A semidefinite programming-based heuristic for graph coloring
- scientific article; zbMATH DE number 1462943 (Why is no real title available?)
- Pricing filtering in Dantzig-Wolfe decomposition
- A Branch-And-Price Approach for Graph Multi-Coloring
- Dual inequalities for stabilized column generation revisited
- ILP models and column generation for the minimum sum coloring problem
- A column generation and branch-and-cut algorithm for the channel assignment problem
- Heuristics for a project management problem with incompatibility and assignment costs
- An exact approach for the vertex coloring problem
- A polyhedral approach for graph coloring
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- A column generation method for the multiple-choice multi-dimensional knapsack problem
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- Solving the list coloring problem through a branch-and-price algorithm
- An extraction and expansion approach for graph coloring
- On the recursive largest first algorithm for graph colouring
- An integer programming approach to b-coloring
- Cross-layer optimization in ultra wideband networks
- An exact algorithm for parallel machine scheduling with conflicts
- A branch and price algorithm for list coloring problem
- The maximum k-colorable subgraph problem and orbitopes
- CsegGraph: a graph colouring instance generator
- Polyhedral studies of vertex coloring problems: the standard formulation
- A polyhedral study of the maximum stable set problem with weights on vertex-subsets
- On edge orienting methods for graph coloring
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- Packing and partitioning orbitopes
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks
- A branch-and-price algorithm for the robust graph coloring problem
- Conceptual clique sampling frameworks to design solution algorithms for the edge clique cover problem
- Exact weighted vertex coloring via branch-and-price
- Column-Generation in Integer Linear Programming
- On column generation formulations for the RWA problem
- A column-generation approach to the multiple knapsack problem with color constraints
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
- Constraint programming-based column generation
- Improving lower bounds for equitable chromatic number
- An exact algorithm for the partition coloring problem
- Lexicographic column generation with a tree search pricing algorithm
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
This page was built for publication: A Column Generation Approach for Graph Coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367049)
