Matheuristics for the capacitated p-Median problem
From MaRDI portal
(Redirected from Publication:5246830)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A bionomic approach to the capacitated \(p\)-median problem
- 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 hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
- A new method for solving capacitated location problems based on a set partitioning approach
- A scatter search heuristic for the capacitated clustering problem
- An effective VNS for the capacitated \(p\)-median problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- Efficient algorithms for the capacitated concentrator location problem
- Greedy random adaptive memory programming search for the capacitated clustering problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Hybridizing exact methods and metaheuristics: a taxonomy
- Local branching
- Matheuristics
- Solving capacitated clustering problems
Cited in
(21)- Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities
- Discrete facility location in machine learning
- The capacitated mobile facility location problem
- Exact methods and a variable neighborhood search for the robust capacitated p-median problem
- Special issue on: `matheuristics`
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- A column generation approach to capacitated p-median problems
- A matheuristic for the MinMax capacitated open vehicle routing problem
- Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS
- An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty
- An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach
- Hybrid genetic algorithms with selective crossover for the capacitated p-Median problem
- A matheuristic for large-scale capacitated clustering
- An effective aggregation heuristic for capacitated facility location problems with many demand points
- An approach to the clustering problem with capacity constraints
- The matching relaxation for a class of generalized set partitioning problems
- A review of mathematical optimization models applied to the sugarcane supply chain
- Efficient Algorithms for the Capacitated 1-Median Problem
- scientific article; zbMATH DE number 2215631 (Why is no real title available?)
- An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs
- Parameter tuning for local-search-based matheuristic methods
This page was built for publication: Matheuristics for the capacitated p-Median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5246830)
