Title:

An Inexact Bundle Approach to Cutting-Stock Problems

Subtitle:

Raport Badawczy = Research Report ; RB/54/2006

Creator:

Kiwiel, Krzysztof

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Date issued/created:

2006

Description:

44 pages ; 21 cm ; Bibliography p. 24-25

Subject and Keywords:

Programowanie całkowitoliczbowe ; Lagrangian relaxation ; Nondifferentiable convex optimization ; Integer programming ; Bundle methods ; Knapsack problems ; Problem plecakowy ; Cutting-stock ; Optymalizacja wypukła nieróżniczkowalna ; Relaksacja lagrange'a

Abstract:

The paper shows that the LP relaxation of the cutting-stock problem can be solved efficiently by the recently proposed inexact bundle method. This method saves work by allowing inaccurate solutions to knapsack subproblems. With suitable rounding heuristics, the proposed method solves almost all the cutting-stock instances from the literature.

Relation:

Raport Badawczy = Research Report

Resource type:

Text

Detailed Resource Type:

Report

Source:

RB-2006-54

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open