Pages that link to "Item:Q955321"
From MaRDI portal
The following pages link to Variable space search for graph coloring (Q955321):
Displaying 35 items.
- A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- A heuristic for the circle packing problem with a variety of containers (Q635155) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem (Q884452) (← links)
- A cooperative search method for the \(k\)-coloring problem (Q928692) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem (Q976006) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- On local search for the generalized graph coloring problem (Q1870000) (← links)
- Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- A note on solving MINLP's using formulation space search (Q2448189) (← links)
- Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
- An adaptive memory algorithm for the \(k\)-coloring problem (Q2467362) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- Informed reactive tabu search for graph coloring (Q2853412) (← links)
- An extraction and expansion approach for graph coloring (Q2868189) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- Graph Coloring Models and Metaheuristics for Packing Applications (Q4634984) (← links)
- Graphical method of representing variable sets for solving search problems (Q5942471) (← links)
