Pages that link to "Item:Q1768599"
From MaRDI portal
The following pages link to Two novel evolutionary formulations of the graph coloring problem (Q1768599):
Displaying 12 items.
- The \(k\)-coloring fitness landscape (Q491197) (← links)
- Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions (Q537837) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- Graph coloring with adaptive evolutionary algorithms (Q1273650) (← links)
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
- On edge orienting methods for graph coloring (Q2385485) (← links)
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
- An evolutionary approach for bandwidth multicoloring problems (Q2482742) (← links)
- (Q4263885) (← links)