Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2009.01.012 / 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.2009.01.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070141720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADD-heuristics' starting procedures for capacitated plant location models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the capacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated facility location: Separation algorithms and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic solution to the warehouse location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic solutions to multi-depot location-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using clustering analysis in a capacitated location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-routing: issues, models and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search-based heuristic to locate capacitated transshipment points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated facility location/network design problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Two-Level Uncapacitated Facility Location Problem / 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: Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Production-Distribution System Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for multimode multicommodity location problems with interdepot balancing requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel branch-and-bound algorithm for multicommodity location with balancing requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of heuristics and relaxations for the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743942 / 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: A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2009.01.012 / rank
 
Normal rank

Latest revision as of 13:33, 10 December 2024

scientific article
Language Label Description Also known as
English
Lower and upper bounds for a capacitated plant location problem with multicommodity flow
scientific article

    Statements

    Lower and upper bounds for a capacitated plant location problem with multicommodity flow (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    location
    0 references
    multicommodity flow
    0 references
    tabu search
    0 references
    lagrangean relaxation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers