A computational study and survey of methods for the single-row facility layout problem (Q354626): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Biq Mac / 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.1007/s10589-012-9505-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063394514 / 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: A polyhedral approach to the single row facility layout problem / 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: Provably near-optimal solutions for very large single-row facility layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up IP-based algorithms for constrained quadratic 0-1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for the Quadratic Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SDP Approach to Multi-level Crossing Minimization / 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: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>r</i>-Dimensional Quadratic Placement Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental analysis of simulated annealing based algorithms for the layout problem / 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: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations of ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-State Processes and Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic procedure for the single-row facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving A One-Dimensional Space Allocation Problem With Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the One-Dimensional Space Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for the one-dimensional space allocation problem / 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: A polyhedral study of triplet formulation for single row facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Dimensional Space Allocation: An Ordering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the linear placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:15, 6 July 2024

scientific article
Language Label Description Also known as
English
A computational study and survey of methods for the single-row facility layout problem
scientific article

    Statements

    A computational study and survey of methods for the single-row facility layout problem (English)
    0 references
    0 references
    0 references
    19 July 2013
    0 references
    0 references
    single-row facility layout
    0 references
    space allocation
    0 references
    semidefinite optimization
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references