scientific article; zbMATH DE number 2215631

MaRDI QIDQ5696416zbMATH OpenFDO

Authors Fabrício Olivetti de França, Fernando J. von Zuben, Leandro Nunes De Castro

Publication date 18 October 2005

Mathematics Subject Classification ID

Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• scientific article; zbMATH DE number 1488089
• Two exact algorithms for the capacitated p-median problem
• Ant colony optimization techniques for the Hamiltonian p-median problem
• A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
• A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
• An ant colony algorithm for the pos/neg weighted \(p\)-median problem
• Matheuristics for the capacitated p-Median problem

Cited in

(5)

• A bionomic approach to the capacitated \(p\)-median problem
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent
• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• scientific article; zbMATH DE number 1488089 (Why is no real title available?)

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 Q5696416)