Matheuristics for the capacitated p‐median problem
From MaRDI portal
Publication:5246830
DOI10.1111/itor.12103zbMath1309.90060OpenAlexW2163494940MaRDI QIDQ5246830
Olinto C. B. de Araújo, Felipe M. Müller, Fernando Stefanello
Publication date: 22 April 2015
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12103
Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
The matching relaxation for a class of generalized set partitioning problems ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ A matheuristic for large-scale capacitated clustering ⋮ Discrete facility location in machine learning ⋮ A matheuristic for the MinMax capacitated open vehicle routing problem ⋮ A review of mathematical optimization models applied to the sugarcane supply chain ⋮ Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS ⋮ An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs ⋮ An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach ⋮ Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities ⋮ The capacitated mobile facility location problem ⋮ Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources ⋮ Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem
Cites Work
- Unnamed Item
- Greedy random adaptive memory programming search for the capacitated clustering problem
- Solving capacitated clustering problems
- An effective VNS for the capacitated \(p\)-median problem
- Hybridizing exact methods and metaheuristics: a taxonomy
- Efficient algorithms for the capacitated concentrator location problem
- A bionomic approach to the capacitated \(p\)-median problem
- Local branching
- A column generation approach to capacitated \(p\)-median problems
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A scatter search heuristic for the capacitated clustering problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem
- Matheuristics
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- A new method for solving capacitated location problems based on a set partitioning approach
This page was built for publication: Matheuristics for the capacitated p‐median problem