A scalable exact algorithm for the vertex \(p\)-center problem
From MaRDI portal
Publication:1634076
DOI10.1016/j.cor.2018.11.006zbMath1458.90423OpenAlexW2901909299MaRDI QIDQ1634076
Claudio Contardo, Manuel Iori, Raphael Kramer
Publication date: 17 December 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.11.006
Related Items
A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, The multi-period \(p\)-center problem with time-dependent travel times, A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem, An iterative exact algorithm for the weighted fair sequences problem, Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem, A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem, Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions, Exact solution approaches for the discrete α‐neighbor p‐center problem, The complete vertex \(p\)-center problem, The stratified \(p\)-center problem, An exact algorithm for a class of geometric set-cover problems, The conditional \(p\)-dispersion problem, Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(p\)-neighbor \(k\)-center problem
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- Double bound method for solving the \(p\)-center location problem
- A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
- Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- A new formulation for the conditional \(p\)-median and \(p\)-center problems
- Aggregation error for location models: Survey and analysis
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem
- The probabilistic \(p\)-center problem: planning service for potential customers
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- Dominant, an algorithm for the \(p\)-center problem.
- Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
- An exact algorithm for the capacitated vertex \(p\)-center problem
- A New Formulation and Resolution Method for the p-Center Problem
- Julia: A Fresh Approach to Numerical Computing
- Efficient Algorithms for the Weighted k-Center Problem on a Real Line
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- Conditional p-Center Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Mathematical Programming and the Location of Fire Companies for the Denver Fire Department
- The Capacitated K-Center Problem
- Location Science
- The m-Center Problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- JuMP: A Modeling Language for Mathematical Optimization
