A decomposition approach for the \(p\)-median problem on disconnected graphs (Q1652380): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Solving huge size instances of the optimal diversity management problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using decomposition to improve greedy solutions of the optimal diversity management problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linking set problem: a polynomial special case of the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition approach for a very large scale optimal diversity management problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Diversity Management Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast primal and dual heuristics for the \(p\)-median location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum weight \(t\)-composition of an integer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bibliography for some fundamental problem categories in discrete location science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution methods for thep-median problem: An annotated bibliography / rank
 
Normal rank

Revision as of 02:12, 16 July 2024

scientific article
Language Label Description Also known as
English
A decomposition approach for the \(p\)-median problem on disconnected graphs
scientific article

    Statements

    Identifiers