A Heuristic Solution of a Cutting Problem Using Hypergraphs (Q4915264)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6152489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Heuristic Solution of a Cutting Problem Using Hypergraphs |
scientific article; zbMATH DE number 6152489 |
Statements
A Heuristic Solution of a Cutting Problem Using Hypergraphs (English)
0 references
9 April 2013
0 references
cutting problem
0 references
one-dimensional
0 references
Gilmore and Gomory approach
0 references
0.9003496
0 references
0 references
0.8894204
0 references
0.8850225
0 references
0.87946934
0 references
0.8794568
0 references
0.8783197
0 references
0.8780819
0 references
