Pages that link to "Item:Q3878752"

The following pages link to A graph coloring algorithm for large scheduling problems (Q3878752):

Displaying 50 items.

• A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
• Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
• New secure partial encryption method for medical images using graph coloring problem (Q330803) (← links)
• Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
• An exact approach for the vertex coloring problem (Q429677) (← links)
• Quantum annealing of the graph coloring problem (Q429697) (← links)
• Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
• Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
• Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms (Q543817) (← links)
• Some experiments with simulated annealing for coloring graphs (Q581241) (← links)
• Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
• Extended box clustering for classification problems (Q724605) (← links)
• Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
• An introduction to timetabling (Q759645) (← links)
• The clique-partitioning problem (Q807637) (← links)
• Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
• A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
• On a parallel genetic-tabu search based algorithm for solving the graph colouring problem (Q1042037) (← links)
• A memetic algorithm for graph coloring (Q1043356) (← links)
• A graph coloring algorithm for large scale scheduling problems (Q1096533) (← links)
• On the complexity of H-coloring (Q1100215) (← links)
• Heuristic for rapidly four-coloring large planar graphs (Q1180542) (← links)
• COSINE: A new graph coloring algorithm (Q1180823) (← links)
• STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
• An adaptive, multiple restarts neural network algorithm for graph coloring (Q1268156) (← links)
• Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
• A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
• Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561) (← links)
• Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• Monte Carlo hyper-heuristics for examination timetabling (Q1761797) (← links)
• An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
• Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
• Genetic and hybrid algorithms for graph coloring (Q1919854) (← links)
• Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
• Privacy-preserving data splitting: a combinatorial approach (Q2035465) (← links)
• A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
• The variational quantum eigensolver: a review of methods and best practices (Q2092477) (← links)
• A new oscillator coupling function for improving the solution of graph coloring problem (Q2127406) (← links)
• An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
• Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
• The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
• Complexity of stability (Q2237893) (← links)
• Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
• General vertex-distinguishing total coloring of graphs (Q2336778) (← links)
• An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371) (← links)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
• Simple decentralized graph coloring (Q2397096) (← links)