Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2019.07.013 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees / 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: Variable neighborhood search for the vertex separation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel variable neighbourhood search strategies for the cutwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth: obstructions and algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrowness, pathwidth, and their application in natural language processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing width in linear layouts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the matrix bandwidth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound for the cutwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min Cut is NP-complete for edge weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional logic gate assignment and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the minimum cut linear arrangement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search for the cutwidth minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid method for the probabilistic maximal covering location-allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and path relinking for the matrix bandwidth minimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antibandwidth and cyclic antibandwidth of meshes and hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth of the de Bruijn graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and path relinking for the max-min diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of variance test for normality (complete samples) / rank
 
Normal rank
Property / cites work
 
Property / cites work: PATHWIDTH AND LAYERED DRAWINGS OF TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2019.07.013 / rank
 
Normal rank

Latest revision as of 19:52, 16 December 2024

scientific article
Language Label Description Also known as
English
Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
scientific article

    Statements

    Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (English)
    0 references
    3 June 2021
    0 references
    combinatorial optimization
    0 references
    heuristics
    0 references
    cutwidth
    0 references
    graph layout
    0 references
    adaptive large neighborhood search
    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
    0 references