A heuristic and an exact method for the gate matrix connection cost minimization problem (Q2862155)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A heuristic and an exact method for the gate matrix connection cost minimization problem |
scientific article; zbMATH DE number 6226938
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic and an exact method for the gate matrix connection cost minimization problem |
scientific article; zbMATH DE number 6226938 |
Statements
A heuristic and an exact method for the gate matrix connection cost minimization problem (English)
0 references
14 November 2013
0 references
time of open stacks
0 references
maximum number of open stacks
0 references
pattern sequencing
0 references
genetic algorithms
0 references
dynamic fitness function
0 references
integer linear programming
0 references
branch-and-cut
0 references
0 references
0 references
0 references
