Pages that link to "Item:Q1749784"
From MaRDI portal
The following pages link to A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784):
Displaying 7 items.
- A genetic algorithm for the maximum 2-packing set problem (Q2019714) (← links)
- On solving the time window assignment vehicle routing problem via iterated local search (Q2056911) (← links)
- Towards faster local search for minimum weight vertex cover on massive graphs (Q2200662) (← links)
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
- An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs (Q6065850) (← links)
