A graph coloring algorithm for large scheduling problems
From MaRDI portal
(Redirected from Publication:3878752)
Cited in
(96)- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- A search space ``cartography for guiding graph coloring heuristics
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
- A memetic algorithm for graph coloring
- A graph coloring algorithm for large scale scheduling problems
- On the complexity of H-coloring
- Heuristic for rapidly four-coloring large planar graphs
- COSINE: A new graph coloring algorithm
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- An adaptive, multiple restarts neural network algorithm for graph coloring
- Hybrid evolutionary search for the minimum sum coloring problem of graphs
- A clique covering MIP model for the irregular strip packing problem
- Online algorithms for the maximum \(k\)-colorable subgraph problem
- Solving graph coloring problems with the Douglas-Rachford algorithm
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Monte Carlo hyper-heuristics for examination timetabling
- An effective heuristic algorithm for sum coloring of graphs
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Genetic and hybrid algorithms for graph coloring
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Privacy-preserving data splitting: a combinatorial approach
- A note on computational approaches for the antibandwidth problem
- The variational quantum eigensolver: a review of methods and best practices
- A new oscillator coupling function for improving the solution of graph coloring problem
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- The minimum chromatic violation problem: a polyhedral approach
- Complexity of stability
- Estimating clique size by coloring the nodes of auxiliary graphs
- General vertex-distinguishing total coloring of graphs
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- Simple decentralized graph coloring
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
- A comparison of integer programming models for the partial directed weighted improper coloring problem
- Supervised box clustering
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- 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
- An ant-based algorithm for coloring graphs
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Another look at graph coloring via propositional satisfiability
- An improved ant colony optimisation heuristic for graph colouring
- A survey of local search methods for graph coloring
- A branch-and-cut algorithm for graph coloring
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
- A new approach to the vertex coloring problem
- Exact solution of graph coloring problems via constraint programming and column generation
- A graph coloring approach to the deployment scheduling and unit assignment problem
- An extraction and expansion approach for graph coloring
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- Determining sparse Jacobian matrices using two-sided compression: an algorithm and lower bounds
- A survey on vertex coloring problems
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
- New secure partial encryption method for medical images using graph coloring problem
- Heuristics for a project management problem with incompatibility and assignment costs
- An exact approach for the vertex coloring problem
- Quantum annealing of the graph coloring problem
- Iterative coloring extension of a maximum clique
- Pattern graph for sparse Hessian matrix
- Coloration de graphes : fondements et applications
- An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
- Man power optimization in large-scale corporations
- Solving vertex coloring problems as maximum weight stable set problems
- Solving CSPs with Naming Games
- Hybrid evolutionary algorithm for the b-chromatic number
- Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
- Some experiments with simulated annealing for coloring graphs
- On the chromatic number of graphs
- Multi-agent oriented constraint satisfaction
- Complexity of Stability.
- Partitioning P₄-tidy graphs into a stable set and a forest
- A degree reduction method for an efficient QUBO formulation for the graph coloring problem
- 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
- Adaptive and parallel multiscale framework for modeling cohesive failure in engineering scale systems
- Source detection on graphs
- Graph coloring via degeneracy in streaming and other space-conscious models
- SAT encoding of partial ordering models for graph coloring problems
- Non-binary dynamical Ising machines for combinatorial optimization
- Graph coloring problem solving using Monte Carlo tree search and deep reinforcement learning
- A fast local search algorithm for minimum sum coloring problem on massive graphs
- Obtaining the Grundy chromatic number: how bad can my greedy heuristic coloring be?
- Maximum strength of connectedness in Ramsey complete fuzzy graphs with Ramsey fuzzy clique and its application
- Clique number estimate based on coloring of the nodes
- On the complexity of the minimum chromatic violation problem
- Improving the extraction and expansion method for large graph coloring
- A near-real-time reduction-based algorithm for coloring massive graphs
- Extended box clustering for classification problems
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
- A parallel branch-and-bound-and-check algorithm for nesting
- An introduction to timetabling
- The clique-partitioning problem
- Using mixed graph coloring to minimize total completion time in job shop scheduling
This page was built for publication: A graph coloring algorithm for large scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3878752)
