A dual bounding scheme for a territory design problem

DOI10.1016/j.cor.2013.11.006zbMath1307.90092OpenAlexW2095218721MaRDI QIDQ2257364

Roger Z. Ríos-Mercado, Mónica G. Elizondo-Amaya, Juan A. Díaz

Publication date: 25 February 2015

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.11.006

zbMATH Keywords

Lagrangian relaxationdiscrete locationcommercial territory designdual bounding scheme

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (5)

An overview of graph covering and partitioning ⋮ Primal and dual bounds for the vertex \(p\)-median problem with balance constraints ⋮ Exact approaches for solving a covering problem with capacitated subtrees ⋮ A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization ⋮ Simultaneous node and link districting in transportation networks: model, algorithms and railway application

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• New models for commercial territory design
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem
• Solving a large scale districting problem: A case report
• A Lagrangean heuristic for the maximal covering location problem
• Relaxation heuristics for a generalized assignment problem
• Optimal political districting
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• Multiobjective scatter search for a commercial territory design problem
• A tabu search heuristic and adaptive memory procedure for political districting
• Lagrangean relaxation. (With comments and rejoinder).
• Local search algorithms for political districting
• An exact algorithm for the capacitated vertex \(p\)-center problem
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
• An Optimization Based Heuristic for Political Districting
• A New Formulation and Resolution Method for the p-Center Problem
• SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
• Sales Territory Alignment: A Review and Model
• Fast Approximation Methods for Sales Force Deployment
• The Maximum Coverage Location Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The m-Center Problem
• Optimal Political Districting by Implicit Enumeration Techniques
• The Location of Emergency Service Facilities
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: A dual bounding scheme for a territory design problem