A cutting plane algorithm for the site layout planning problem with travel barriers (Q1652264): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56476026 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / 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.2017.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2572737251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-facility location-allocation problem with polyhedral barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for facility location in the presence of forbidden regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar expropriation problem with non-rigid rectangular facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rectilinear distance Weber problem in the presence of a probabilistic line barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar location problems with block distance and barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction result for location problems with polyhedral barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the dynamic facility layout problem with unequal-area departments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing heuristics for the dynamic facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear distance to a facility in the presence of a square barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Size Facility Placement in the Presence of Barriers to Rectilinear Travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to STaTS for practical applications of the facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring instance difficulty for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank

Latest revision as of 02:10, 16 July 2024

scientific article
Language Label Description Also known as
English
A cutting plane algorithm for the site layout planning problem with travel barriers
scientific article

    Statements

    A cutting plane algorithm for the site layout planning problem with travel barriers (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    site layout planning
    0 references
    mixed integer programming
    0 references
    cutting plane algorithms
    0 references
    decomposition methods
    0 references
    global optimisation
    0 references
    \(d\)-visibility
    0 references

    Identifiers