The planar hub location problem: a probabilistic clustering approach (Q2449351): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-013-1394-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965230511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Location of Hub Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hub location and routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interacting New Facilities and Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic d-clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition for the uncapacitated multiple allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Large-Scale Uncapacitated Hub Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation in hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting polyhedral properties from facility to hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Weiszfeld method for the multi-facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for hub location problems with single assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic integer program for the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A clustering approach to the planar hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub network design with single and multiple allocation: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Weiszfeld algorithm for the Fermat-Weber location problem / rank
 
Normal rank

Revision as of 11:37, 8 July 2024

scientific article
Language Label Description Also known as
English
The planar hub location problem: a probabilistic clustering approach
scientific article

    Statements

    The planar hub location problem: a probabilistic clustering approach (English)
    0 references
    0 references
    8 May 2014
    0 references
    hub location problem
    0 references
    planar hub location
    0 references
    clustering
    0 references
    Fermat-Weber problem
    0 references
    probabilistic assignments
    0 references
    0 references
    0 references
    0 references

    Identifiers