Solving the plant location problem on a line by linear programming (Q1284603): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming: Methods, Uses, Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐bound algorithm for the capacitated facilities location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact solution of large-scale simple plant location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility siting and integer-friendly programming / rank
 
Normal rank

Latest revision as of 19:37, 28 May 2024

scientific article
Language Label Description Also known as
English
Solving the plant location problem on a line by linear programming
scientific article

    Statements

    Solving the plant location problem on a line by linear programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 1999
    0 references
    0 references
    plant location
    0 references
    integer friendliness
    0 references
    uncapacitated plant location
    0 references
    linear programming relaxation
    0 references
    \(p\)-median problem
    0 references