A scatter search-based heuristic to locate capacitated transshipment points (Q878590): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2005.11.020 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SITATION / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MOD-DIST / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MENU-OKF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Scatter Search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / 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.2005.11.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082270393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search. Methodology and implementation in C. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental evaluation of heuristic optimization algorithms: A tutorial / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for solving a capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach to capacitated \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient genetic algorithm for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search procedure for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms of ant system and simulated annealing for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid scatter search and path relinking for the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming heuristic for the \(P\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Distribution System Design by Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and coordination of production and distribution facilities for multiple commodities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for the two-echelon, single-source, capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LP-based heuristic for two-stage capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Lagrangian relaxation to the resolution of two-stage location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual-based optimization procedure for the two-echelon uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of scatter search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2005.11.020 / rank
 
Normal rank

Latest revision as of 06:43, 10 December 2024

scientific article
Language Label Description Also known as
English
A scatter search-based heuristic to locate capacitated transshipment points
scientific article

    Statements

    A scatter search-based heuristic to locate capacitated transshipment points (English)
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    two-stage location
    0 references
    transshipment
    0 references
    scatter search
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers