Experiments on the minimum linear arrangement problem (Q5463444): 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: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QAPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaco / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090995721 / 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: Optimal Linear Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Algorithm for Seriation and the Consecutive Ones Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path optimization for graph partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB - a quadratic assignment problem library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs / 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: Approximating layout problems on random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Assignments of Numbers to Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal linear labelings and eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140423 / 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: Equation of State Calculations by Fast Computing Machines / 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: Q3893961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Estimating the Largest Eigenvalue with the Lanczos Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimum Linear Arrangement Algorithm for Undirected Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 10 June 2024

scientific article; zbMATH DE number 2192072
Language Label Description Also known as
English
Experiments on the minimum linear arrangement problem
scientific article; zbMATH DE number 2192072

    Statements

    Experiments on the minimum linear arrangement problem (English)
    0 references
    0 references
    4 August 2005
    0 references
    algorithm
    0 references
    minimum linear arrangement problem
    0 references
    experimental analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references