Dual-Based Local Search for the Connected Facility Location and Related Problems

DOI10.1287/ijoc.1090.0375zbMath1243.90085OpenAlexW2084749979MaRDI QIDQ2899090

No author found.

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1e21fdf136f4a16a4010d2c4ebe8ae12224dcb16

zbMATH Keywords

local searchnetwork designSteiner treedual ascentconnected facility location

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (14)

The \(p\)-arborescence star problem: formulations and exact solution approaches ⋮ Approximate robust optimization for the connected facility location problem ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Models and algorithms for network reduction ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ General network design: a unified view of combined location and network design problems ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) ⋮ Computing Minimum k-Connected m-Fold Dominating Set in General Graphs ⋮ Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set ⋮ Branch-and-cut-and-price for capacitated connected facility location ⋮ An algorithmic framework for the exact solution of tree-star problems ⋮ MIP models for connected facility location: a theoretical and computational study ⋮ The incremental connected facility location problem

This page was built for publication: Dual-Based Local Search for the Connected Facility Location and Related Problems