Pages that link to "Item:Q2467355"
From MaRDI portal
The following pages link to Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355):
Displaying 10 items.
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Three new upper bounds on the chromatic number (Q765327) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- CsegGraph: a graph colouring instance generator (Q3643182) (← links)
- Expected polynomial-time randomized algorithm for graph coloring problem (Q6558677) (← links)
