Pages that link to "Item:Q1870000"
From MaRDI portal
The following pages link to On local search for the generalized graph coloring problem (Q1870000):
Displaying 9 items.
- A mathematical model and a metaheuristic approach for a memory allocation problem (Q519090) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- Local optima topology for the \(k\)-coloring problem (Q1327233) (← links)
- Local 7-coloring for planar subgraphs of unit disk graphs (Q2430012) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)