Optimization of a line-cutting procedure for ship hull construction by an effective tabu search (Q3605417): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
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.1080/00207540600607242 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2072676880 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tabu Search—Part I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A combined approach to the solution to the general one-dimensional cutting stock problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cutting optimization with variable-sized stock and inventory status data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:39, 29 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimization of a line-cutting procedure for ship hull construction by an effective tabu search |
scientific article |
Statements
Optimization of a line-cutting procedure for ship hull construction by an effective tabu search (English)
0 references
24 February 2009
0 references
ship hull construction
0 references
unbounded Knapsack problem
0 references
tabu search
0 references
decrease move
0 references
increase move
0 references
breaking replacement move
0 references
aggregative replacement move
0 references
0 references