Pages that link to "Item:Q1804580"
From MaRDI portal
The following pages link to Greedy randomized adaptive search procedures (Q1804580):
Displaying 50 items.
- Improved solutions to the Steiner triple covering problem (Q293185) (← links)
- A survey of recent research on location-routing problems (Q296678) (← links)
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers (Q301906) (← links)
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- Network repair crew scheduling and routing for emergency relief distribution problem (Q320672) (← links)
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (Q322469) (← links)
- Integer programming models for feature selection: new extensions and a randomized solution algorithm (Q322475) (← links)
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- Heuristics for the generalized median graph problem (Q323345) (← links)
- A hybrid approach for the vehicle routing problem with three-dimensional loading constraints (Q336326) (← links)
- A GRASP metaheuristic for microarray data analysis (Q336713) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- A hybrid data mining GRASP with path-relinking (Q336726) (← links)
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
- GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- A redistricting problem applied to meter reading in power distribution networks (Q336759) (← links)
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792) (← links)
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
- Enhanced controlled tabular adjustment (Q336885) (← links)
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints (Q337213) (← links)
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
- A heuristic algorithm for a supply chain's production-distribution planning (Q337603) (← links)
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
- On double cycling for container port productivity improvement (Q338901) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- The constrained shortest path tour problem (Q342457) (← links)
- The dynamic vehicle allocation problem with application in trucking companies in Brazil (Q342558) (← links)
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
- Evolutionary optimization: pitfalls and booby traps (Q389022) (← links)
- Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179) (← links)
- Similarities between meta-heuristics algorithms and the science of life (Q441019) (← links)
- Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem (Q447561) (← links)
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
- A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures (Q496107) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
