Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-012-1221-3 / 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.1007/s10479-012-1221-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028634810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3500144 / 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: Q3134873 / 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: 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: The Transportation-Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gradual covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general global optimization approach for solving location problems in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location with acceleration-deceleration distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming by Implicit Enumeration and Balas’ Method / 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: 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: A guided reactive GRASP 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: GBSSS: The generalized big square small square method for planar single- facility location / 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: 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 squared-euclidean distance location-allocation problem / 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: 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: Some Properties of Location Problems with Block and Round Norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Block Norms for Location Modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the point for which the sum of the distances to \(n\) given points is minimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location Theory, Dominance, and Convexity / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-012-1221-3 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:10, 9 December 2024

scientific article
Language Label Description Also known as
English
Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
scientific article

    Statements

    Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (English)
    0 references
    0 references
    0 references
    22 January 2015
    0 references
    branch and bound
    0 references
    discrete approximation
    0 references
    facility location-allocation
    0 references
    transportation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references