A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem (Q2840754): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57856176, #quickstatements; #temporary_batch_1712272666262
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2012.10.010 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for protein similarity search under mRNA structure constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for the minimum cut and the minimum length tree layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth II: Algorithms for partial w-trees of bounded degree / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/endm/PardoMPD12 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2012.10.010 / rank
 
Normal rank

Latest revision as of 00:51, 20 December 2024

scientific article
Language Label Description Also known as
English
A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem
scientific article

    Statements

    Identifiers