Pages that link to "Item:Q955609"

The following pages link to A reactive GRASP for a commercial territory design problem with multiple balancing requirements (Q955609):

Displaying 30 items.

• The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
• Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← links)
• The synchronized arc and node routing problem: application to road marking (Q336355) (← links)
• A redistricting problem applied to meter reading in power distribution networks (Q336759) (← links)
• Dynamic design of sales territories (Q337456) (← links)
• Large-scale pickup and delivery work area design (Q339655) (← links)
• Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
• New models for commercial territory design (Q411270) (← links)
• A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
• Risk-balanced territory design optimization for a micro finance institution (Q781085) (← links)
• Validating vehicle routing zone construction using Monte Carlo simulation (Q976400) (← links)
• Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
• Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
• Multiobjective scatter search for a commercial territory design problem (Q1761773) (← links)
• Workload equity in vehicle routing: the impact of alternative workload resources (Q2002854) (← links)
• A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization (Q2026965) (← links)
• Simultaneous node and link districting in transportation networks: model, algorithms and railway application (Q2030544) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
• A dual bounding scheme for a territory design problem (Q2257364) (← links)
• An optimization-based approach for the healthcare districting under uncertainty (Q2669521) (← links)
• A novel model for arc territory design: promoting Eulerian districts (Q2811937) (← links)
• Districting for Arc Routing (Q2940070) (← links)
• Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands (Q5131702) (← links)
• A sample approximation solution procedure for chance-constrained districting problems (Q6068707) (← links)
• Tabu search with strategic oscillation for improving collection assignment plans of waste electric and electronic equipment (Q6079874) (← links)
• Approximation schemes for districting problems with probabilistic constraints (Q6106979) (← links)
• Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
• A comparison between optimization tools to solve sectorization problem (Q6629015) (← links)