Pages that link to "Item:Q1804580"

The following pages link to Greedy randomized adaptive search procedures (Q1804580):

Displaying 50 items.

• Fuzzy optimization for distribution of frozen food with imprecise times (Q1927273) (← links)
• A GRASP heuristic for the manufacturing cell formation problem (Q1939100) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
• Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP (Q1962023) (← links)
• Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
• A multi-product production/distribution system design problem with direct shipments and lateral transshipments (Q2005789) (← links)
• GRASP with variable neighborhood descent for the online order batching problem (Q2022211) (← links)
• Revenue maximization of Internet of things provider using variable neighbourhood search (Q2022217) (← links)
• Joint optimization of container slot planning and truck scheduling for tandem quay cranes (Q2030512) (← links)
• A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
• A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
• A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130) (← links)
• An infeasible space exploring matheuristic for the production routing problem (Q2076821) (← links)
• Exact and heuristic algorithms for the maximum weighted submatrix coverage problem (Q2076862) (← links)
• Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
• An efficient GRASP-like algorithm for the multi-product straight pipeline scheduling problem (Q2108188) (← links)
• A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning (Q2116920) (← links)
• A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
• A GRASP for the convex recoloring problem in graphs (Q2132370) (← links)
• Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
• New formulations and solution approaches for the latency location routing problem (Q2147033) (← links)
• A greedy randomized adaptive search procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem (Q2147067) (← links)
• A metaheuristic algorithm for ship weather routing (Q2167652) (← links)
• Integration of routing into a resource-constrained project scheduling problem (Q2175371) (← links)
• Efficient approaches for the flooding problem on graphs (Q2178332) (← links)
• Mathematical models to improve the current practice in a home healthcare unit (Q2178910) (← links)
• A min-max regret approach to maximum likelihood inference under incomplete data (Q2191235) (← links)
• A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
• Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
• RAMP algorithms for the capacitated facility location problem (Q2240709) (← links)
• Finding efficient make-to-order production and batch delivery schedules (Q2242200) (← links)
• Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290) (← links)
• An efficient variable neighborhood search for the space-free multi-row facility layout problem (Q2242375) (← links)
• Optimal control in citrus diseases (Q2245722) (← links)
• Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
• Cutting ellipses from area-minimizing rectangles (Q2250089) (← links)
• Embedding signed graphs in the line (Q2253962) (← links)
• A multi-objective GRASP procedure for reactive power compensation planning (Q2254191) (← links)
• Emergency response in natural disaster management: allocation and scheduling of rescue units (Q2256339) (← links)
• Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations (Q2257351) (← links)
• Algorithms for the design of network topologies with balanced disjoint rings (Q2267818) (← links)
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem (Q2271122) (← links)
• Metaheuristic algorithms for the hybrid flowshop scheduling problem (Q2273670) (← links)
• A greedy randomized adaptive search procedure for the orienteering problem with hotel selection (Q2286963) (← links)
• Loading tow trains ergonomically for just-in-time part supply (Q2301970) (← links)
• On location-allocation problems for dimensional facilities (Q2317850) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Analysis of properties of quantum hashing (Q2331334) (← links)
• Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)