Optimal linear arrangements using betweenness variables (Q1762457): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ZIB Optimization Suite / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / 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/s12532-011-0027-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090282626 / 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 mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement 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: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / 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: Laying Out Sparse Graphs with Provably Minimum Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840361 / 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: Approximating Layout Problems on Random Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments on the minimum linear arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086030 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:49, 5 July 2024

scientific article
Language Label Description Also known as
English
Optimal linear arrangements using betweenness variables
scientific article

    Statements

    Optimal linear arrangements using betweenness variables (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    linear arrangement problem
    0 references
    polyhedral combinatorics
    0 references
    branch-and-bound algorithm
    0 references
    computational results
    0 references
    0 references
    0 references
    0 references
    0 references