A random-key GRASP for combinatorial optimization
From MaRDI portal
Cites work
- k-server problems with bulk requests: an application to tool switching in manufacturing
- A biased random-key genetic algorithm for the tree of hubs location problem
- A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation
- A probabilistic heuristic for a computationally difficult set covering problem
- A Python/C library for bound-constrained global optimization with continuous GRASP
- A reactive GRASP with path relinking for capacitated clustering
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem
- A Simplex Method for Function Minimization
- An improved Benders decomposition algorithm for the tree of hubs location problem
- An interior point algorithm to solve computationally difficult set covering problems
- Benchmarking optimization software with performance profiles.
- Cliques and clustering: A combinatorial approach
- Correspondence of projected 3-D points and lines using a continuous GRASP
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Global optimization by continuous grasp
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 3119645 (Why is no real title available?)
- scientific article; zbMATH DE number 51347 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
- Improved heuristic algorithms for the job sequencing and tool switching problem
- Improved solutions to the Steiner triple covering problem
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Multiple allocation tree of hubs location problem for non-complete networks
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Russian doll search for the Steiner triple covering problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving hard set covering problems
- Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
- Speeding up continuous GRASP
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- The node capacitated graph partitioning problem: A computational study
- The tree of hubs location problem
- Tight bounds from a path based formulation for the tree of hub location problem
- Variable neighborhood search
Cited in
(2)
This page was built for publication: A random-key GRASP for combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6668154)
