An algorithm for solving large capacitated warehouse location problems (Q1099067): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/0377-2217(88)90175-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017330843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location models for distribution planning / 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: Linear Relaxations of the Capacitated Warehouse Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial dual algorithm for the capacitated warehouse location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic lagrangean algorithm for the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A search tree algorithm for plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Optimization: An Application to the Capacitated Plant Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem / 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: Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of tree indexing methods in transportation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the capacitated plant location model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling Facility Location Problems as Generalized Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving large-scale mixed-integer programs with fixed charge variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cross Decomposition Algorithm for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse Location / rank
 
Normal rank

Latest revision as of 16:09, 18 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for solving large capacitated warehouse location problems
scientific article

    Statements

    An algorithm for solving large capacitated warehouse location problems (English)
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    lower bound
    0 references
    capacitated warehouse location
    0 references
    Lagrangean relaxation
    0 references
    mixed-integer formulation
    0 references
    tree search
    0 references
    0 references
    0 references
    0 references