Pages that link to "Item:Q3393983"

The following pages link to An annotated bibliography of GRASP-Part II: Applications (Q3393983):

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)
• A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures (Q496107) (← 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)
• A GRASP metaheuristic to improve accessibility after a disaster (Q647512) (← links)
• Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
• Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129) (← 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)
• A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem (Q959510) (← links)
• Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
• Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
• The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
• GRASP and VNS for solving the \(p\)-next center problem (Q1725619) (← links)
• Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
• A multi-product production/distribution system design problem with direct shipments and lateral transshipments (Q2005789) (← 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)
• Flow shop scheduling problem with position-dependent processing times (Q2273687) (← links)
• Towards an efficient resolution of printing problems (Q2339840) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• Packing items to feed assembly lines (Q2384618) (← 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)
• 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)
• Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) (← links)
• A metaheuristic for security budget allocation in utility networks (Q2968500) (← links)
• An annotated bibliography of GRASP – Part I: Algorithms (Q3601200) (← 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)
• Solving a bus driver scheduling problem with randomized multistart heuristics (Q4918247) (← links)
• A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (Q4921475) (← links)
• Probabilistic stopping rules for GRASP heuristics and extensions (Q4924054) (← links)