Pages that link to "Item:Q2467354"
From MaRDI portal
The following pages link to An ant-based algorithm for coloring graphs (Q2467354):
Displaying 18 items.
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← links)
- Three new upper bounds on the chromatic number (Q765327) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Optimization by ant algorithms: possible roles for an individual ant (Q1758036) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← links)
- An improved ant colony optimisation heuristic for graph colouring (Q2473031) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- Informed reactive tabu search for graph coloring (Q2853412) (← links)
- An ant colony algorithm for graph coloring and labeling problems (Q2858214) (← links)
- Ant Local Search and its efficient adaptation to graph colouring (Q3582660) (← links)
- CsegGraph: a graph colouring instance generator (Q3643182) (← links)
- Ants can colour graphs (Q4367017) (← links)
- (Q4546602) (← links)
- Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization (Q5391957) (← links)
