A search tree algorithm for plant location problems (Q1149880): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Optimal Location of Plants / 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: Q4120279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Location Theory: A Selective Bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Exact Solution of the Fixed-Charge Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Branch and Bound Algorithm for the Warehouse Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Private and Public Sector Location Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Simple Plant-Location Problem with Some Side Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem / rank
 
Normal rank

Latest revision as of 10:38, 13 June 2024

scientific article
Language Label Description Also known as
English
A search tree algorithm for plant location problems
scientific article

    Statements

    A search tree algorithm for plant location problems (English)
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    search tree algorithm
    0 references
    plant location
    0 references
    ranking procedure
    0 references
    stopping rule
    0 references
    lower bound
    0 references
    computational results
    0 references
    logistics
    0 references

    Identifiers