A Column Generation Approach for Graph Coloring
From MaRDI portal
Publication:4367049
DOI10.1287/ijoc.8.4.344zbMath0884.90144OpenAlexW2013946649WikidataQ56657188 ScholiaQ56657188MaRDI QIDQ4367049
Anuj Mehrotra, Michael A. Trick
Publication date: 25 November 1997
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a824afc7b8c832e7557df21b88126a46b9a275dc
Related Items
A branch and price algorithm for list coloring problem, A polyhedral study of the maximum stable set problem with weights on vertex-subsets, An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration, Improving lower bounds for equitable chromatic number, A column generation approach for solving the examination-timetabling problem, Lower bounding techniques for DSATUR-based branch and bound, On edge orienting methods for graph coloring, ILP approaches to the blockmodel problem, An exact algorithm with learning for the graph coloring problem, An exact algorithm for the partition coloring problem, Simple decentralized graph coloring, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, An exact algorithm for parallel machine scheduling with conflicts, A Wide Branching Strategy for the Graph Coloring Problem, A supernodal formulation of vertex colouring with applications in course timetabling, A comparison of integer programming models for the partial directed weighted improper coloring problem, Total coloring and total matching: polyhedra and facets, An integer programming approach to b-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, Symmetry-breaking inequalities for ILP with structured sub-symmetry, Maximum-weight stable sets and safe lower bounds for graph coloring, Heuristics for a project management problem with incompatibility and assignment costs, An exact approach for the vertex coloring problem, The maximum-impact coloring polytope, Unnamed Item, Exact weighted vertex coloring via branch-and-price, Packing and partitioning orbitopes, A branch-and-price algorithm for the robust graph coloring problem, The general \(\alpha \)-decomposition problem of fuzzy relations, Graph Coloring Using GPUs, A graph coloring heuristic using partial solutions and a reactive tabu scheme, The maximum \(k\)-colorable subgraph problem and orbitopes, An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem, A survey on vertex coloring problems, A column generation and branch-and-cut algorithm for the channel assignment problem, Cross-layer optimization in ultra wideband networks, A branch-and-price algorithm for the minimum sum coloring problem, ILP models and column generation for the minimum sum coloring problem, Safe Lower Bounds for Graph Coloring, 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, Constrained clustering by constraint programming, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, A column generation based algorithm for the robust graph coloring problem, Solving the minimum-weighted 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, Variable space search for graph coloring, Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles, Comparison of bundle and classical column generation, Directed weighted improper coloring for cellular channel allocation, A new branch-and-bound algorithm for the maximum weighted clique problem, On the asymmetric representatives formulation for the vertex coloring problem, A wide-ranging computational comparison of high-performance graph colouring algorithms, Embedding a novel objective function in a two-phased local search for robust vertex coloring, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, Solving a multicoloring problem with overlaps using integer programming, A column generation method for the multiple-choice multi-dimensional knapsack problem, An exact method for graph coloring, A branch-and-cut algorithm for graph coloring, A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes, On the application of graph colouring techniques in round-robin sports scheduling, 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, A branch-and-cut algorithm for partition coloring, A NEW APPROACH TO THE VERTEX COLORING PROBLEM, An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs, A near-optimal optimization algorithm for link assignment in wireless ad-hoc networks, A one-to-one correspondence between colorings and stable sets, 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, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation, Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results, Column-Generation in Integer Linear Programming, An inexact bundle variant suited to column generation, Cliques and clustering: A combinatorial approach, An incremental search heuristic for coloring vertices of a graph, On column generation formulations for the RWA problem, CsegGraph: a graph colouring instance generator, Combinatorial optimization in system configuration design, Cliques, holes and the vertex coloring polytope, Three new upper bounds on the chromatic number, A simple branching scheme for vertex coloring problems, Graph coloring by multiagent fusion search, Models and heuristic algorithms for a weighted vertex coloring problem, Enhancing CP-based column generation for integer programs, A network-flow-based lower bound for the minimum weighted integer coloring problem, Interval scheduling with economies of scale, 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, Graph coloring with decision diagrams, An unconstrained quadratic binary programming approach to the vertex coloring problem, On compact formulations for integer programs solved by column generation, On the queen graphs coloring problem., Graph Coloring Lower Bounds from Decision Diagrams, Iterative coloring extension of a maximum clique, Branch-and-Cut-and-Price algorithms for the preemptive RCPSP, On optimization formulations for radio resource allocation subject to common transmission rate, Adaptive solution prediction for combinatorial optimization, 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, Constraint programming-based column generation, Constraint programming-based column generation, Comparison of column generation models for channel assignment in cellular networks, Models and solution techniques for frequency assignment problems, On the recursive largest first algorithm for graph colouring, A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
Uses Software
