Pages that link to "Item:Q707129"

The following pages link to Greedy random adaptive memory programming search for the capacitated clustering problem (Q707129):

Displaying 20 items.

• A redistricting problem applied to meter reading in power distribution networks (Q336759) (← links)
• A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
• A heuristic method for the vehicle routing problem with mixed deliveries and pickups (Q835589) (← links)
• Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
• A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
• Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
• An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
• An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls (Q1037690) (← links)
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
• A multi-product production/distribution system design problem with direct shipments and lateral transshipments (Q2005789) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
• The capacitated centred clustering problem (Q2581607) (← links)
• A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
• Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems (Q3509441) (← links)
• (Q4495206) (← links)
• STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES (Q5055035) (← links)
• Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
• PCB assembly scheduling for collect-and-place machines using genetic algorithms (Q5438685) (← links)
• Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)