scientific article; zbMATH DE number 894762

MaRDI QIDQ4883008zbMATH OpenFDO

Authors Nenad Mladenović, José A. Moreno, J. Marcos Moreno-Vega

Publication date 9 October 1996

zbMATH Keywords

heuristicslocation-allocation problemschain-interchange movetabu search-like technique

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 3316891
• Heuristic chaining in directed acyclic graphs
• Heuristics of the Cocks-Pinch method
• scientific article; zbMATH DE number 4091179
• scientific article; zbMATH DE number 5274743
• An Optimal Algorithm for the Maximum Two-Chain Problem
• Heuristics for the mixed swapping problem
• An Optimal Algorithm for the Maximum Three-Chain Problem
• scientific article; zbMATH DE number 1260462
• Optimum Algorithms for a Model of Direct Chaining

Cited in

(10)

• The linear ordering problem with clusters: a new partial ranking
• The \(p\)-median problem: a survey of metaheuristic approaches
• Variable neighborhood search: Principles and applications
• Variable neighborhood tabu search and its application to the median cycle problem.
• scientific article; zbMATH DE number 5274743 (Why is no real title available?)
• DE-VNS: self-adaptive differential evolution with crossover neighborhood search for continuous global optimization
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
• Heuristics of the Cocks-Pinch method
• On the method of interchanging networks for permutation problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883008)