Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations (Q1013385): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2008.08.003 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2008.08.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091051356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-Hard, Capacitated, Balanced <i>p</i>-Median Problems on a Chain Graph with a Continuum of Link Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Always-Convergent Numerical Scheme for a Random Locational Equilibrium Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Facility Location for Normally and Exponentially Distributed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic transportation-location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling Inter-city Road Distances by Mathematical Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Models of Road Travel Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The plant location problem with demand-dependent setup costs and centralized allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5767400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transportation-Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perturbation-based heuristic for the capacitated multisource Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the Weber location problem on the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solution of the multisource Weber problem as a \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Location Theory, Dominance, and Convexity: Some Further Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristic methods for the capacitated multi-facility Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cellular heuristic for the multisource Weber problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic formulations of the multifacility weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling imperfect advance demand information and analysis of optimal inventory policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization Procedures for the Capacitated Euclidean and <i>l<sub>p</sub></i> Distance Multifacility Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noising methods: A generalization of some metaheuristics / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2008.08.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:49, 10 December 2024

scientific article
Language Label Description Also known as
English
Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
scientific article

    Statements

    Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations (English)
    0 references
    0 references
    17 April 2009
    0 references
    capacitated multisource Weber problem
    0 references
    probabilistic customer locations
    0 references
    heuristics
    0 references
    0 references
    0 references

    Identifiers