An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2165563862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Allocate Network Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>K</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on solving large p-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach to capacitated \(p\)-median problems / rank
 
Normal rank

Latest revision as of 16:48, 24 June 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for the capacitated vertex \(p\)-center problem
scientific article

    Statements

    Identifiers