The decomposition method for the p-median problem on a disconnected graph

zbMATH Open1249.90226MaRDI QIDQ3115658FDOQ3115658

Authors: Igor' Leonidovich Vasilyev 

Publication date: 10 February 2012

Recommendations

• A decomposition approach for the \(p\)-median problem on disconnected graphs
• A decomposition approach for a very large scale optimal diversity management problem
• Computational study of large-scale \(p\)-median problems
• A branch decomposition algorithm for the \(p\)-median problem
• A note on solving large p-median problems

zbMATH Keywords

diversity management problemvery large scale problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (5)

• Pseudo-median graphs: Decomposition via amalgamation and Cartesian multiplication
• Decomposition and \(l_1\)-embedding of weakly median graphs
• Title not available (Why is that?)
• A decomposition approach for the \(p\)-median problem on disconnected graphs
• A decomposition approach for a very large scale optimal diversity management problem

This page was built for publication: The decomposition method for the \(p\)-median problem on a disconnected graph

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