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)- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- An inexact bundle variant suited to column generation
- On column generation formulations for the RWA problem
- Combinatorial optimization in system configuration design
- Cliques, holes and the vertex coloring polytope
- Graph coloring by multiagent fusion search
- Models and heuristic algorithms for a weighted vertex coloring problem
- Enhancing CP-based column generation for integer programs
- Cliques and clustering: A combinatorial approach
- A combinatorial column generation algorithm for the maximum stable set problem
- A network-flow-based lower bound for the minimum weighted integer coloring problem
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- An exact algorithm for the partition coloring problem
- ILP models and column generation for the minimum sum coloring problem
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Polyhedral studies of vertex coloring problems: the standard formulation
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- Maximum-weight stable sets and safe lower bounds for graph coloring
- A branch-and-price algorithm for the minimum sum coloring problem
- A new branch-and-bound algorithm for the maximum weighted clique problem
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- An incremental search heuristic for coloring vertices of a graph
- Interval scheduling with economies of scale
- Graph coloring with decision diagrams
- A branch and price algorithm for list coloring problem
- Improving lower bounds for equitable chromatic number
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- Directed weighted improper coloring for cellular channel allocation
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments
- A branch-and-price approach for the partition coloring problem
- On edge orienting methods for graph coloring
- Simple decentralized graph coloring
- An exact algorithm for parallel machine scheduling with conflicts
- A comparison of integer programming models for the partial directed weighted improper coloring problem
- An integer programming approach to b-coloring
- A branch-and-price algorithm for the robust graph coloring problem
- The general \(\alpha \)-decomposition problem of fuzzy relations
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
- Cross-layer optimization in ultra wideband networks
- Generalised graph colouring by a hybrid of local search and constraint programming
- A cutting plane algorithm for graph coloring
- A semidefinite programming-based heuristic for graph coloring
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Efficient algorithms for finding critical subgraphs
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Comparison of bundle and classical column generation
- On the asymmetric representatives formulation for the vertex coloring problem
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- An exact method for graph coloring
- A branch-and-cut algorithm for graph coloring
- A near-optimal optimization algorithm for link assignment in wireless ad-hoc networks
- A one-to-one correspondence between colorings and stable sets
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Total coloring and total matching: polyhedra and facets
- A polyhedral approach for graph coloring
- Solving the minimum-weighted coloring problem
- A new approach to the vertex coloring problem
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- Dual inequalities for stabilized column generation revisited
- Exact solution of graph coloring problems via constraint programming and column generation
- An extraction and expansion approach for graph coloring
- A column-generation approach to the multiple knapsack problem with color constraints
- A Wide Branching Strategy for the Graph Coloring Problem
- The maximum-impact coloring polytope
- A polyhedral study of the maximum stable set problem with weights on vertex-subsets
- A survey on vertex coloring problems
- Safe lower bounds for graph coloring
- A branch-and-cut algorithm for partition coloring
- scientific article; zbMATH DE number 434500 (Why is no real title available?)
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
- A column generation approach for solving the examination-timetabling problem
- Lower bounding techniques for DSATUR-based branch and bound
- Graph coloring using GPUs
- An exact algorithm with learning for the graph coloring problem
- A Branch-And-Price Approach for Graph Multi-Coloring
- CsegGraph: a graph colouring instance generator
- A Pruning Procedure for Exact Graph Coloring
- Fractional programming formulation for the vertex coloring problem
- Exploring the role of graph spectra in graph coloring algorithm performance
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- Heuristics for a project management problem with incompatibility and assignment costs
- An exact approach for the vertex coloring problem
- Column-Generation in Integer Linear Programming
- scientific article; zbMATH DE number 1462943 (Why is no real title available?)
- Exact weighted vertex coloring via branch-and-price
- Iterative coloring extension of a maximum clique
- Branch-and-cut-and-price algorithms for the preemptive RCPSP
- Graph coloring lower bounds from decision diagrams
- Constrained clustering by constraint programming
- Constraint and satisfiability reasoning for graph coloring
- The vehicle routing problem with floating targets: formulation and solution approaches
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
- A column generation based algorithm for the robust graph coloring problem
- On the recursive largest first algorithm for graph colouring
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)
