The following pages link to Optimization by GRASP (Q3186644):
Displayed 40 items.
- A survey on optimization metaheuristics (Q497180) (← links)
- A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization (Q711332) (← links)
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
- A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
- An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
- Revenue maximization of Internet of things provider using variable neighbourhood search (Q2022217) (← links)
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing (Q2026991) (← links)
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications (Q2028795) (← links)
- Optimizing tactical harvest planning for multiple fruit orchards using a metaheuristic modeling approach (Q2029339) (← links)
- A FPGA-based accelerated architecture for the continuous GRASP (Q2047509) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning (Q2116920) (← links)
- Optimizing node infiltrations in complex networks by a local search based heuristic (Q2273672) (← links)
- Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- MineReduce: an approach based on data mining for problem size reduction (Q2664324) (← links)
- An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization (Q2669525) (← links)
- The leader multipurpose shopping location problem (Q2672066) (← links)
- A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem (Q2675709) (← links)
- Capacitated clustering problems applied to the layout of IT-teams in software factories (Q2675719) (← links)
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
- Extending time‐to‐target plots to multiple instances (Q4624885) (← links)
- The Capacitated and Economic Districting Problem (Q5106398) (← links)
- Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
- A no-delay single machine scheduling problem to minimize total weighted early and late work (Q6063508) (← links)
- A two-phase multi-objective metaheuristic for a green UAV grid routing problem (Q6063517) (← links)
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows (Q6065841) (← links)
- Graph fragmentation problem: analysis and synthesis (Q6066278) (← links)
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) (← links)
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows (Q6079872) (← links)
- The two‐echelon routing problem with truck and drones (Q6082194) (← links)
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469) (← links)
- Complexity and heuristics for the weighted max cut‐clique problem (Q6091425) (← links)
- Optimal decision trees for the algorithm selection problem: integer programming based approaches (Q6092614) (← links)
- An enhanced GRASP approach for the index tracking problem (Q6146646) (← links)
- Efficient GRASP solution approach for the prisoner transportation problem (Q6164367) (← links)