Matheuristics for the capacitated p-Median problem

DOI10.1111/ITOR.12103zbMATH Open1309.90060OpenAlexW2163494940MaRDI QIDQ5246830FDOQ5246830

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

Recommendations

• Special issue on: `matheuristics`
• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• A matheuristic for large-scale capacitated clustering
• A bionomic approach to the capacitated \(p\)-median problem
• A hybrid heuristic for the \(p\)-median problem

zbMATH Keywords

capacitated \(p\)-median problemsize reductionmatheuristic algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• A bionomic approach to the capacitated \(p\)-median problem
• A scatter search heuristic for the capacitated clustering problem
• Local branching
• A column generation approach to capacitated \(p\)-median problems
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
• Matheuristics
• Efficient algorithms for the capacitated concentrator location problem
• A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Solving capacitated clustering problems
• Hybridizing exact methods and metaheuristics: a taxonomy
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
• A new method for solving capacitated location problems based on a set partitioning approach
• Greedy random adaptive memory programming search for the capacitated clustering problem
• An effective VNS for the capacitated \(p\)-median problem

Cited In (16)

• 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
• 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
• The matching relaxation for a class of generalized set partitioning problems
• A review of mathematical optimization models applied to the sugarcane supply chain
• Title not available (Why is that?)
• Efficient Algorithms for the Capacitated 1-Median Problem
• An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs

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)