Pages that link to "Item:Q1410622"
From MaRDI portal
The following pages link to A variable neighborhood search for graph coloring. (Q1410622):
Displaying 41 items.
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- Consistent neighborhood search for combinatorial optimization (Q693704) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- Solving the unconstrained optimization problem by a variable neighborhood search (Q864633) (← links)
- A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation (Q953839) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm (Q972655) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application (Q991831) (← links)
- Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Corrigendum to ``Variable space search for graph coloring'' [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)] (Q1028098) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- On a parallel genetic-tabu search based algorithm for solving the graph colouring problem (Q1042037) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem (Q1736555) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
- An improved ant colony optimisation heuristic for graph colouring (Q2473031) (← links)
- A survey of local search methods for graph coloring (Q2489304) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
- Informed reactive tabu search for graph coloring (Q2853412) (← links)
- An extraction and expansion approach for graph coloring (Q2868189) (← links)
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines (Q2883611) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem (Q3163164) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- Heuristics for determining the number of warehouses for storing non-compatible products (Q3410327) (← links)
- An ant colony optimisation algorithm for scheduling in agile manufacturing (Q3533169) (← links)
- Constructing Two-Level Designs by Concatenation of Strength-3 Orthogonal Arrays (Q6621638) (← links)
