On a binary distance model for the minimum linear arrangement problem (Q458974): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11750-012-0263-7 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: ABACUS / rank
 
Normal rank
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: Harwell-Boeing sparse matrix collection / 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/s11750-012-0263-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066368324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Job Sequencing with Precedence Constraints / 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: Optimal linear arrangements using betweenness variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-conquer approximation algorithms via spreading metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithmics for linear arrangement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear arrangement problem parameterized above guaranteed value / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Review of the Placement and Quadratic Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping the genome / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414506 / 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: Optimal Numberings of an $N \times N$ Array / 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: Q4036610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minimum linear arrangement by multilevel weighted edge contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to ABACUS -- a branch-and-cut system / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11750-012-0263-7 / rank
 
Normal rank

Latest revision as of 18:13, 9 December 2024

scientific article
Language Label Description Also known as
English
On a binary distance model for the minimum linear arrangement problem
scientific article

    Statements

    On a binary distance model for the minimum linear arrangement problem (English)
    0 references
    0 references
    0 references
    0 references
    8 October 2014
    0 references
    linear arrangement problem
    0 references
    graph layout
    0 references
    integer programming
    0 references

    Identifiers