A Heuristic Solution of a Cutting Problem Using Hypergraphs (Q4915264): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_33 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W90909061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Trim Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Linear Programming Approach to the Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study / rank
 
Normal rank

Latest revision as of 08:04, 6 July 2024

scientific article; zbMATH DE number 6152489
Language Label Description Also known as
English
A Heuristic Solution of a Cutting Problem Using Hypergraphs
scientific article; zbMATH DE number 6152489

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references