Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement (Q1974322): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Packing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multistage Cutting Stock Problems of Two and More Dimensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3801335 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem / rank | |||
Normal rank | |||
Latest revision as of 15:40, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement |
scientific article |
Statements
Application of the method of Lagrangian multipliers in the combinatorial problem of rectangle arrangement (English)
0 references
3 January 2001
0 references
A new exact solution method is described for the problem of cutting a given set of rectangular pieces out of a band of fixed width and minimal length. It is based on successive Lagrangian relaxation of a description as a disjunctive linear program. No proof of convergence to optimality, nor numerical results are given.
0 references
rectangle cutting
0 references
Lagrangian relaxation
0 references
