A survey on vertex coloring problems
From MaRDI portal
Publication:3002686
DOI10.1111/j.1475-3995.2009.00696.xzbMath1223.05079OpenAlexW2007033386MaRDI QIDQ3002686
Publication date: 23 May 2011
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00696.x
algorithmscomputational resultsvertex coloringmathematical formulationbandwidth coloringbounded vertex coloringweighted vertex coloring
Related Items
A simple and effective algorithm for the maximum happy vertices problem, A graph coloring approach to the deployment scheduling and unit assignment problem, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, Improving lower bounds for equitable chromatic number, Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks, Lower bounding techniques for DSATUR-based branch and bound, An exact algorithm for the partition coloring problem, A clique covering MIP model for the irregular strip packing problem, Spectrum graph coloring and applications to Wi-Fi channel assignment, A matching pursuit approach to solenoidal filtering of three-dimensional velocity measurements, A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques, A systematic study on meta-heuristic approaches for solving the graph coloring problem, Iterated local search with tabu search for the weighted vertex coloring problem, A Wide Branching Strategy for the Graph Coloring Problem, On properly ordered coloring of vertices in a vertex-weighted graph, Grouping products for the optimization of production processes: a case in the steel manufacturing industry, Total coloring and total matching: polyhedra and facets, Graph multi-coloring for a job scheduling application, Thirty years of International Transactions in Operational Research: past, present, and future direction, Systematic reviews as a metaknowledge tool: caveats and a review of available options, Fractional programming formulation for the vertex coloring problem, On distance graph coloring problems, On the complexity of coloring ‐graphs, Adaptive solution prediction for combinatorial optimization, Determining the Minimum Number of Warehouses and their Space-Size for Storing Compatible Items, Upper and lower bounds based on linear programming for the b-coloring problem, The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study, A new vertex coloring heuristic and corresponding chromatic number, CliSAT: a new exact algorithm for hard maximum clique problems, Collective dynamics of phase-repulsive oscillators solves graph coloring problem, Adaptive feasible and infeasible tabu search for weighted vertex coloring, A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG, Maximum-weight stable sets and safe lower bounds for graph coloring, An exact approach for the vertex coloring problem, Exact weighted vertex coloring via branch-and-price, Constraint and Satisfiability Reasoning for Graph Coloring, Relaxing the assumptions of knockoffs by conditioning, Regular inference as vertex coloring, Multi-coloring and job-scheduling with assignment and incompatibility costs, Practical Implementation of a Quantum Backtracking Algorithm, Graph Coloring Models and Metaheuristics for Packing Applications, 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, A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem, Bounds on spectrum graph coloring, Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks, Solving the wire-harness design problem at a European car manufacturer, Solving vertex coloring problems as maximum weight stable set problems, Hybrid evolutionary algorithm for the b-chromatic number, Optimization by ant algorithms: possible roles for an individual ant, Uncertain vertex coloring problem, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring, Improving the extraction and expansion method for large graph coloring, Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments, An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs, A branch-and-cut algorithm for the edge interdiction clique problem, A note on computational approaches for the antibandwidth problem, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation, A simple branching scheme for vertex coloring problems, Vehicle Sequencing at Transshipment Terminals with Handover Relations, INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING, Dominated colorings of graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- Bounded vertex colorings of graphs
- An introduction to timetabling
- Time slot scheduling of compatible jobs
- Variable space search for graph coloring
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- Cliques, holes and the vertex coloring polytope
- Weighted coloring: further complexity and approximability results
- A variable neighborhood search for graph coloring.
- Heuristics and lower bounds for the bin packing problem with conflicts
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- An approximation scheme for bin packing with conflicts
- Hybrid evolutionary algorithms for graph coloring
- Generalised graph colouring by a hybrid of local search and constraint programming
- Efficient algorithms for finding critical subgraphs
- An adaptive memory algorithm for the \(k\)-coloring problem
- Batch processing with interval graph compatibilities between tasks
- On the asymmetric representatives formulation for the vertex coloring problem
- An evolutionary approach for bandwidth multicoloring problems
- A survey of local search methods for graph coloring
- Algorithms for the Bin Packing Problem with Conflicts
- A Metaheuristic Approach for the Vertex Coloring Problem
- A graph coloring algorithm for large scheduling problems
- A Column Generation Approach for Graph Coloring
- A Heuristic Method for the Set Covering Problem
- Chromatic Scheduling and the Chromatic Number Problem
