Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701): 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.1016/j.cor.2013.07.013 / 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.2013.07.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989258712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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: Parametric distance functions vs. nonparametric neural networks for estimating road travel distances / 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: Region-rejection based heuristics for the capacitated multi-source Weber 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: 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: A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem / 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: Efficient heuristics for the rectilinear distance capacitated multi-facility Weber 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: 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: Efficient approximate solution methods for the multi-commodity capacitated multi-facility 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: Q4229629 / 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: Location Theory, Dominance, and Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Set of Optimal Points to the Weber Problem: Further Results / 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: Some Properties of Location Problems with Block and Round Norms / 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: The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems / 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: The gradual covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location with acceleration-deceleration distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minisum and Minimax Location Problems Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Single Machine Early/Tardy Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recovering beam search algorithm for the single machine just-in-time scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2013.07.013 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:47, 9 December 2024

scientific article
Language Label Description Also known as
English
Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
scientific article

    Statements

    Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    location-allocation
    0 references
    transportation
    0 references
    branch and bound
    0 references
    beam search
    0 references
    0 references
    0 references

    Identifiers