A connectivity graph generation approach for Manhattan path calculation in detailed facility layout (Q274980): Difference between revisions

From MaRDI portal
Added link to MaRDI 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/j.amc.2014.03.100 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078206956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear paths with minimum segment lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transitive minimum Manhattan subnetwork problem in 3 dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detailed layout planning for irregularly-shaped machines with transportation path design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved genetic algorithm for facility layout problems having inner structure walls and passages / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L_ 1\) shortest paths among polygonal obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Algorithms: An Evaluation Using Real Road Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear paths among rectilinear obstacles / rank
 
Normal rank

Latest revision as of 20:13, 11 July 2024

scientific article
Language Label Description Also known as
English
A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
scientific article

    Statements

    A connectivity graph generation approach for Manhattan path calculation in detailed facility layout (English)
    0 references
    0 references
    25 April 2016
    0 references
    facilities planning and design
    0 references
    detailed layout
    0 references
    Manhattan path
    0 references
    connectivity graph
    0 references
    plane sweep algorithm
    0 references

    Identifiers