Exponential neighborhood search for consecutive block minimization

DOI10.1111/itor.13065OpenAlexW3212035094WikidataQ115532347 ScholiaQ115532347MaRDI QIDQ6082185

Salim Haddadi

Publication date: 29 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13065

zbMATH Keywords

TSPlocal searchexponential neighborhood searchconsecutive block minimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Reordering columns for smaller indexes
• Consecutive block minimization is 1.5-approximable
• 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
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• 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
• Heuristic approaches for the family traveling salesman problem

This page was built for publication: Exponential neighborhood search for consecutive block minimization