Parallel variable neighbourhood search strategies for the cutwidth minimization problem

DOI10.1093/imaman/dpt026zbMath1433.90132OpenAlexW2313976183WikidataQ57855940 ScholiaQ57855940MaRDI QIDQ5382675

Juan José Pantrigo, Abraham Duarte, Eduardo G. Pardo, Jesús Sánchez-Oro

Publication date: 18 June 2019

Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imaman/dpt026

zbMATH Keywords

variable neighbourhood searchparallel designsvariable formulation searchcutwidth minimization problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, In memory of Professor Nenad Mladenović (1951--2022), A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems, A variable neighborhood search approach for the crew pairing problem, Variable neighborhood descent for the incremental graph drawing, A parallel variable neighborhood search approach for the obnoxious p‐median problem, Variable neighborhood scatter search for the incremental graph drawing problem, General variable neighborhood search for the order batching and sequencing problem, Population-based iterated greedy algorithm for the S-labeling problem, A variable neighborhood search approach for the vertex bisection problem, GRASP and VNS for solving the \(p\)-next center problem, GRASP with variable neighborhood descent for the online order batching problem, Multistart search for the cyclic cutwidth minimization problem, Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem, On solving the order processing in picking workstations, A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem, Packing a fixed number of identical circles in a circular container with circular prohibited areas, A general variable neighborhood search for the cyclic antibandwidth problem