Pages that link to "Item:Q4904584"

The following pages link to Geo-Graphs: An Efficient Model for Enforcing Contiguity and Hole Constraints in Planar Graph Partitioning (Q4904584):

Displaying 15 items.

• A multi-criteria police districting problem for the efficient and effective design of patrol sector (Q319842) (← links)
• Dynamic design of sales territories (Q337456) (← links)
• Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
• The geo-graph in practice: creating United States congressional districts from census blocks (Q683330) (← links)
• A multi-objective districting problem applied to agricultural machinery maintenance service network (Q2024004) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• Parliament seating assignment problems (Q2242347) (← links)
• Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints (Q2253998) (← links)
• Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
• An optimization-based approach for the healthcare districting under uncertainty (Q2669521) (← links)
• Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
• Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
• Redistricting optimization with recombination: a local search case study (Q6068697) (← links)
• 3D geo-graphs: efficient flip verification for the spherical zoning problem (Q6110624) (← links)
• (Q6160407) (← links)