Bounding procedures and exact solutions for a class of territory design problems

DOI10.1007/978-3-030-34312-5_5zbMath1472.90052OpenAlexW3005214682MaRDI QIDQ1980465

Juan A. Díaz, María G. Sandoval, Dolores E. Luna

Publication date: 8 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-34312-5_5

zbMATH Keywords

upper boundsLagrangian relaxationrelaxationcompactness\(p\)-median problemlower boundscontiguityheuristicsubgradient optimizationbalanceinteger quadratic programmingLagrangian dualterritory designexact optimization method

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Discrete location and assignment (90B80)

Related Items (2)

The balanced \(p\)-median problem with unitary demand ⋮ A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization

This page was built for publication: Bounding procedures and exact solutions for a class of territory design problems