Heuristic methods to consecutive block minimization

DOI10.1016/J.COR.2020.104948MaRDI QIDQ2664289zbMATH OpenOpenAlexFDO

Authors Leonardo Cabral R. Soares, Jordi Alves Reinsma, Luis H. L. Nascimento, Marco Antonio M. Carvalho

Publication date 20 April 2021

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

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

zbMATH Keywords

combinatorial problemsconsecutive block minimizationexact algorithmsiterated local searchmetaheuristic

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• Iterated local search for consecutive block minimization
• Polynomial-time local-improvement algorithm for consecutive block minimization
• Minimising the number of gap-zeros in binary matrices
• scientific article; zbMATH DE number 5606342
• scientific article; zbMATH DE number 1594515

Cites work

• A method for solving the minimization of the maximum number of open stacks problem within a cutting process
• A method for solving traveling-salesman problems
• A note on the NP-hardness of the consecutive block minimization problem
• A Spectral Algorithm for Seriation and the Consecutive Ones Problem
• An analysis of variance test for normality (complete samples)
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• Consecutive block minimization is 1.5-approximable
• Glass cutting in a small firm
• scientific article; zbMATH DE number 1187154 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Improved heuristic algorithms for the job sequencing and tool switching problem
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• Minimising the number of gap-zeros in binary matrices
• NP-completeness of the Hamming salesman problem
• On Physical Mapping and the consecutive ones property for sparse matrices
• PC trees and circular-ones arrangements.
• Physical mapping of chromosomes: A combinatorial problem in molecular biology
• Polynomial Complete Consecutive Information Retrieval Problems
• Polynomial-time local-improvement algorithm for consecutive block minimization
• THE PROBABLE ERROR OF A MEAN
• TTT plots: a perl program to create time-to-target plots

Cited in

(6)

• Polynomial-time local-improvement algorithm for consecutive block minimization
• Minimising the number of gap-zeros in binary matrices
• Iterated local search for consecutive block minimization
• Exponential neighborhood search for consecutive block minimization
• Mathematical models for the minimization of open stacks problem
• On computing optimal linear diagrams

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: Heuristic methods to consecutive block minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664289)