Pages that link to "Item:Q1577374"
From MaRDI portal
The following pages link to A greedy genetic algorithm for the quadratic assignment problem (Q1577374):
Displaying 46 items.
- A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems (Q727261) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks (Q817525) (← links)
- A genetic ant colony optimisation system (GenANT) for quadratic assignment problems (Q843378) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm (Q965550) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- Interactive evolutionary multi-objective optimization for quasi-concave preference functions (Q976331) (← links)
- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge (Q1002061) (← links)
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
- A genetic approach to the quadratic assignment problem (Q1342320) (← links)
- Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem (Q1567487) (← links)
- An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal (Q1719017) (← links)
- The extended concentric tabu for the quadratic assignment problem (Q1887907) (← links)
- Solving a multi-objective interval crew-scheduling problem via genetic algorithms (Q1929495) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network (Q2196017) (← links)
- A multi-parent genetic algorithm for the quadratic assignment problem (Q2359229) (← links)
- A parallel water flow algorithm with local search for solving the quadratic assignment problem (Q2423282) (← links)
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (Q2456632) (← links)
- Compounded genetic algorithms for the quadratic assignment problem (Q2488198) (← links)
- The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm (Q2489363) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- A hybrid metaheuristic for the quadratic assignment problem (Q2506186) (← links)
- Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly (Q2517416) (← links)
- A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem (Q2666872) (← links)
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices (Q2832890) (← links)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
- DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM (Q3052722) (← links)
- An ejection chain algorithm for the quadratic assignment problem (Q3057181) (← links)
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration (Q3163728) (← links)
- Two-level modified simulated annealing based approach for solving facility layout problem (Q3498919) (← links)
- Constrained evolutionary computing approach to Web service compositions (Q4909000) (← links)
- A new genetic representation for quadratic assignment problem (Q5412739) (← links)
- A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM (Q5487850) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)
- An efficient algorithm for unequal area facilities layout planning with input and output points (Q5884349) (← links)
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)
- Hybridizations of evolutionary algorithms with large neighborhood search (Q6158769) (← links)
- Where the really hard quadratic assignment problems are: the QAP-SAT instances (Q6635983) (← links)
