Pages that link to "Item:Q3612429"
From MaRDI portal
The following pages link to A Large Neighborhood Search Heuristic for Graph Coloring (Q3612429):
Displaying 8 items.
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- Neural network-based heuristic algorithms for hypergraph coloring problems with applications. (Q1414734) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile (Q4680754) (← links)