Iterated local search for consecutive block minimization

DOI10.1016/j.cor.2021.105273OpenAlexW3135860989MaRDI QIDQ2668701

Salim Haddadi

Publication date: 7 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105273

zbMATH Keywords

iterated local searchconsecutive block minimizationlarge-scale neighborhoodtraveling salesman problem solver

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Operations research and management science (90Bxx)

Related Items (1)

On computing optimal linear diagrams

Uses Software

• OR-Library
• Concorde
• GitHub

Cites Work

• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property
• Reordering columns for smaller indexes
• Consecutive block minimization is 1.5-approximable
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Improved heuristic algorithms for the job sequencing and tool switching problem
• A method for solving the minimization of the maximum number of open stacks problem within a cutting process
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• Polynomial-time local-improvement algorithm for consecutive block minimization
• Incidence matrices and interval graphs
• Heuristic methods to consecutive block minimization
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• Polynomial Complete Consecutive Information Retrieval Problems
• Glass cutting in a small firm
• A note on the NP-hardness of the consecutive block minimization problem
• Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP
• Unnamed Item

This page was built for publication: Iterated local search for consecutive block minimization