Decorous combinatorial lower bounds for row layout problems (Q2189888): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simulated annealing and tabu search approaches for the Corridor Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound for the Minimum Linear Arrangement of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact solution of a facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Approach to the One-Dimensional Facility Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the single row facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The corridor allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal solutions for the double row layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel ordering problem in facilities layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to the single row facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution Approaches for the Double-Row Equidistant Facility Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved exact approaches for row layout problems with departments of equal length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite optimization approach for the single-row layout problem with unequal dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Approaches for Facility Layout and VLSI Floorplanning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably near-optimal solutions for very large single-row facility layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining simulation and optimization for extended double row facility layout problems in factory planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decorous Lower Bounds for Minimum Linear Arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The double row layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP algorithm for solving large-scale single row facility layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single row facility layout problem using a permutation-based genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hospital Layout as a Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Exact Approach to the Space-Free Double Row Layout Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New exact approaches to row layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition-based algorithm for the double row layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double-row facility layout with replicate machines and split flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine layout problem in modern manufacturing facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient models for the facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The checkpoint ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite optimization-based approach for global optimization of multi-row facility layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study and survey of methods for the single-row facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations of ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single row layout models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spine layout design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dynamic programming algorithm for the parallel machines total weighted completion time problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating lower bounds for the linear arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the single-row equidistant facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search for single row facility layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast simulated annealing for single-row equidistant facility layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu algorithm for the single row facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved mixed-integer programming model for the double row layout of facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directional decomposition heuristic for a linear machine-cell location problem. / rank
 
Normal rank

Latest revision as of 22:25, 22 July 2024

scientific article
Language Label Description Also known as
English
Decorous combinatorial lower bounds for row layout problems
scientific article

    Statements

    Decorous combinatorial lower bounds for row layout problems (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2020
    0 references
    facilities planning and design
    0 references
    integer programming
    0 references
    row layout problem
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers