Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems (Q3401336): 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.1111/j.1475-3995.2009.00708.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015434556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions for constrained two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approach for large-scale two-dimensional guillotine cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved version of Wang's algorithm for two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems / rank
 
Normal rank

Latest revision as of 10:54, 2 July 2024

scientific article
Language Label Description Also known as
English
Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
scientific article

    Statements

    Identifiers