A bionomic approach to the capacitated \(p\)-median problem

From MaRDI portal
Publication:1273663

DOI10.1023/A:1009665717611zbMath0913.90201MaRDI QIDQ1273663

Roberto Baldacci, Vittorio Maniezzo, Aristide Mingozzi

Publication date: 6 January 1999

Published in: Journal of Heuristics (Search for Journal in Brave)




Related Items (20)

STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODESA cutting plane method for knapsack polytopeA matheuristic for large-scale capacitated clusteringSolving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNSAn Image-Based Approach to Detecting Structural Similarity Among Mixed Integer ProgramsBudget constrained location problem with opening and closing of facilities.A column generation approach to capacitated \(p\)-median problemsAn effective VNS for the capacitated \(p\)-median problemAnt colony optimization for finding medians of weighted graphsA cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planesA comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problemCapacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstructionGreedy random adaptive memory programming search for the capacitated clustering problemModel-based capacitated clustering with posterior regularizationA new method for solving capacitated location problems based on a set partitioning approachMatheuristics for the capacitated p‐median problemA scatter search heuristic for the capacitated clustering problemHybrid scatter search and path relinking for the capacitated \(p\)-median problemA heuristic method for solving the problem of partitioning graphs with supply and demandScatter search and bionomic algorithms for the aircraft landing problem




This page was built for publication: A bionomic approach to the capacitated \(p\)-median problem