Pages that link to "Item:Q869001"
From MaRDI portal
The following pages link to A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding (Q869001):
Displayed 16 items.
- Fuzzy colouring of fuzzy graphs (Q258334) (← links)
- A graph coloring approach to the deployment scheduling and unit assignment problem (Q283268) (← links)
- New secure partial encryption method for medical images using graph coloring problem (Q330803) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- A hybrid scatter search heuristic for personalized crew rostering in the airline industry (Q976415) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- A General Branch-and-Cut Framework for Rotating Workforce Scheduling (Q5087722) (← links)
- (Q6106851) (← links)