A branch-and-bound algorithm for the two-dimensional vector packing problem (Q1317086): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3993418 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3347319 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Resource constrained scheduling as generalized bin packing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bithreshold Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants / rank | |||
Normal rank | |||
Latest revision as of 13:36, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-bound algorithm for the two-dimensional vector packing problem |
scientific article |
Statements
A branch-and-bound algorithm for the two-dimensional vector packing problem (English)
0 references
24 March 1994
0 references
two-dimensional vector packing
0 references
heuristic
0 references
first fit decreasing rule
0 references
branch-and-bound
0 references
