A heuristic and an exact method for the gate matrix connection cost minimization problem

DOI10.1111/itor.12025zbMath1281.90040OpenAlexW1548790034WikidataQ58002881 ScholiaQ58002881MaRDI QIDQ2862155

No author found.

Publication date: 14 November 2013

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

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

zbMATH Keywords

genetic algorithmsinteger linear programmingbranch-and-cutpattern sequencingdynamic fitness functionmaximum number of open stackstime of open stacks

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Optimal patchings for consecutive ones matrices ⋮ Mathematical models for the minimization of open stacks problem

Uses Software

• SCIP

Cites Work

• Unnamed Item
• SCIP: solving constraint integer programs
• Tuning metaheuristics. A machine learning Perspective
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Heuristic and exact methods for the cutting sequencing problem
• Improved heuristics for sequencing cutting patterns
• 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
• A structure theorem for the consecutive 1's property
• An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: A heuristic and an exact method for the gate matrix connection cost minimization problem