Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem

DOI10.1007/s10852-005-9015-0zbMath1114.90075OpenAlexW2464622307MaRDI QIDQ853803

Nikolay Kosarev, Alexander A. Kolokolov

Publication date: 17 November 2006

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-005-9015-0

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85)

Related Items

Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem, Estimation of the number of iterations in integer programming algorithms using the regular partitions method, Regularized decomposition of large scale block-structured robust optimization problems, Convexity and optimization with copulæ structured probabilistic constraints

Cites Work

• Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem
• Partitioning procedures for solving mixed-variables programming problems
• A tree search algorithm for the p-median problem
• An efficient tabu search procedure for the \(p\)-median problem
• Logic-based Benders decomposition
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Multicommodity Distribution System Design by Benders Decomposition
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Variable neighborhood search for the p-median
• Unnamed Item
• Unnamed Item
• Unnamed Item