Fast neighborhood search for two- and three-dimensional nesting problems (Q2643957): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TOPOS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.063 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086037850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translating a convex polyhedron over monotone polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu thresholding implementation for the irregular stock cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search approach for two-dimensional irregular cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a tabu search approach for solving the two-dimensional irregular cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the intersection-depth to polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution approaches to irregular nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jostling for position: local improvement for irregular cutting patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for polygon placement using a bottom-left strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search for the Three-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-exchange heuristic for nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach to the nesting problem in the textile manufacturing industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nesting problem in the leather manufacturing industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On genetic algorithms for the packing of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compaction and separation algorithms for non-convex polygons and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite stock cutting through simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast neighborhood search for two- and three-dimensional nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOPOS -- A new constructive algorithm for nesting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Phi\)-functions for complex 2D-objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided local search and its application to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank

Latest revision as of 14:22, 26 June 2024

scientific article
Language Label Description Also known as
English
Fast neighborhood search for two- and three-dimensional nesting problems
scientific article

    Statements

    Fast neighborhood search for two- and three-dimensional nesting problems (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2007
    0 references
    0 references
    cutting
    0 references
    packing
    0 references
    guided local search
    0 references
    0 references
    0 references