Pages that link to "Item:Q3601200"
From MaRDI portal
The following pages link to An annotated bibliography of GRASP – Part I: Algorithms (Q3601200):
Displaying 50 items.
- Heuristics for the generalized median graph problem (Q323345) (← 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 path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- The constrained shortest path tour problem (Q342457) (← links)
- A sequential GRASP for the therapist routing and scheduling problem (Q398907) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- A GRASP heuristic for slab scheduling at continuous casters (Q480761) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- A survey on optimization metaheuristics (Q497180) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (Q763242) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems (Q764792) (← links)
- Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
- A GRASP algorithm for the multi-criteria minimum spanning tree problem (Q940883) (← links)
- A greedy randomized adaptive search procedure for the feedback vertex set problem (Q1288478) (← links)
- GRASP for set packing problems. (Q1420382) (← links)
- Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
- Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
- A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times (Q1651555) (← links)
- Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
- GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
- A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
- Probability distribution of solution time in GRASP: an experimental investigation (Q1850990) (← links)
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
- An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem (Q2108188) (← links)
- A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations (Q2147036) (← links)
- GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122) (← links)
- Towards an efficient resolution of printing problems (Q2339840) (← links)
- A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines (Q2393485) (← links)
- A biased random-key genetic algorithm for data clustering (Q2436000) (← links)
- Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
- The leader multipurpose shopping location problem (Q2672066) (← links)
- GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem (Q2673563) (← links)
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
- A reactive grasp for transmission network expansion planning (Q2776550) (← links)
- GRASP: An annoted bibliography (Q2776563) (← links)
- Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
- An approach for efficient ship routing (Q2865160) (← links)
- A metaheuristic for security budget allocation in utility networks (Q2968500) (← links)
- An annotated bibliography of GRASP-Part II: Applications (Q3393983) (← links)
- A GRASP for graph planarization (Q4347284) (← links)
- Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications (Q4918246) (← links)
