Pages that link to "Item:Q263202"
From MaRDI portal
The following pages link to The convex recoloring problem: polyhedra, facets and computational experiments (Q263202):
Displaying 7 items.
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- A GRASP for the convex recoloring problem in graphs (Q2132370) (← links)
- Strong intractability results for generalized convex recoloring problems (Q2184691) (← links)
- Strong intractability of generalized convex recoloring problems (Q2413156) (← links)
- Strong inequalities and a branch-and-price algorithm for the convex recoloring problem (Q2673556) (← links)
- A heuristic for the convex recoloring problem in graphs (Q6071077) (← links)
- An Exact Solution Method for the Political Districting Problem (Q6135729) (← links)