Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969): 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.1016/j.cor.2011.03.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994561740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric distance functions vs. nonparametric neural networks for estimating road travel distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches / 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: Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3649086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating convergence in the Fermat-Weber location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Transportation-Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Confidence Limits for the Global Optimum in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229629 / 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: A statistical approach to the tsp / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point estimation of a global optimum for large combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval estimation of a global optimum for large combinatorial problems / 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: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of solutions for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Region-rejection based heuristics for the capacitated multi-source Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / 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: 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: A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A squared-euclidean distance location-allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of Location Problems with Block and Round Norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Block Norms for Location Modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5767400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location Theory, Dominance, and Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Case study on statistically estimating minimum makespan for flow line scheduling problems. / rank
 
Normal rank

Latest revision as of 21:04, 5 July 2024

scientific article
Language Label Description Also known as
English
Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
scientific article

    Statements

    Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (English)
    0 references
    0 references
    15 November 2012
    0 references
    location-allocation
    0 references
    multi-commodity transportation problem
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers