A polyhedral approach to the single row facility layout problem (Q378107): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6225206 / rank
 
Normal rank
Property / zbMATH Keywords
 
facility layout
Property / zbMATH Keywords: facility layout / rank
 
Normal rank
Property / zbMATH Keywords
 
polyhedral combinatorics
Property / zbMATH Keywords: polyhedral combinatorics / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-cut
Property / zbMATH Keywords: branch-and-cut / 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/s10107-012-0533-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982846944 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57702149 / 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 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: Stronger linear programming relaxations of max-cut / 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: A branch and bound algorithm for maximum likelihood paired comparison ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Approaches to Mixed Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fifty-Plus Years of Combinatorial Integer Programming / 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: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / 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: A computational study and survey of methods for the single-row facility layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-State Processes and Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Facial Structure of the Set of Correlation Matrices / 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: 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: Minimum cuts and related problems / 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: An ant algorithm for the single row layout problem in flexible manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional scaling. I: Theory and method / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:37, 7 July 2024

scientific article
Language Label Description Also known as
English
A polyhedral approach to the single row facility layout problem
scientific article

    Statements

    A polyhedral approach to the single row facility layout problem (English)
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    0 references
    facility layout
    0 references
    polyhedral combinatorics
    0 references
    branch-and-cut
    0 references
    0 references
    0 references