Pages that link to "Item:Q408371"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371):
Displaying 5 items.
- A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
- A simple branching scheme for vertex coloring problems (Q765355) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)