Pages that link to "Item:Q3582660"
From MaRDI portal
The following pages link to Ant Local Search and its efficient adaptation to graph colouring (Q3582660):
Displaying 11 items.
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← 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)
- Probabilistic pursuits on graphs (Q2330128) (← links)
- Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
- Graph Coloring Models and Metaheuristics for Packing Applications (Q4634984) (← links)
- Solution Methods for Fuel Supply of Trains (Q6160380) (← links)