Pages that link to "Item:Q2482742"
From MaRDI portal
The following pages link to An evolutionary approach for bandwidth multicoloring problems (Q2482742):
Displaying 10 items.
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- The vertex coloring problem and its generalizations (Q1022440) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem (Q1686849) (← links)
- Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model (Q2413162) (← links)
- Bandwidth consecutive multicolorings of graphs (Q2445874) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
