An inexact bundle approach to cutting-stock problems - Digital Repository of Scientific Institutes

Skip to main menu
Skip to search engine
Skip to content
Skip to footer

An inexact bundle approach to cutting-stock problems

Download

Title: An inexact bundle approach to cutting-stock problems

Creator:

Kiwiel, Krzysztof

Date issued/created:

Resource type:

Subtitle:

Raport Badawczy = Research Report ; RB/40/2008

Publisher:

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

Place of publishing:

Description:

52 pages ; 21 cm ; Bibliography p. --0

Abstract:

The paper presents a bundle method for minimizing the sum of two convex functions, one of them being known only via an oracle of arbitrary accuracy. Each iteration involves solving two subproblems in which the functions are alternately represented by their linearizations. This approach is motivated by applications to nonlinear multicommodity flow problems. Encouraging numerical experience on large scale problems is reported. It is shown 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

Detailed Resource Type:

Resource Identifier:

oai:rcin.org.pl:144843

Source:

Language:

Language of abstract:

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:

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 Rozkrój materiału

Object collections:

Last modified:

Oct 19, 2021

In our library since:

Oct 28, 2020

Number of object content downloads / hits:

46

All available object's versions:

https://rcin.org.pl/publication/180429

Show description in RDF format:

Show description in RDFa format:

Show description in OAI-PMH format:

Raporty Badawcze

Edition name	Date
RB-2008-40 : Kiwiel Krzysztof Czesław : An inexact bundle approach to cutting-stock problems	Oct 19, 2021

Objects Similar

An Inexact Bundle Approach to Cutting-Stock Problems

Kiwiel, Krzysztof

2006

Text

A proximal bundle method with approximate subgradient linearizations

Kiwiel, Krzysztof

2003

Text

Aproximal-Projection Bundle Method for Lagrangian Relaxation, Including Semidefine Programming

Kiwiel, Krzysztof

2006

Text

Aproximal-Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming

Kiwiel, Krzysztof

2005

Text

An Inexact Bundle Approach to Cutting Stock Problems

Kiwiel, Krzysztof

2004

Text

Lagrangian Relaxation via Ballstep Subgradient Methods

Kiwiel, Krzysztof Larsson, Torbjörn Lindberg, Per

2006

Text

Lagrangian Relaxation via Ballstep Subgradient Methods

Kiwiel, Krzysztof Larsson, Torbjörn Lindberg, Per

2005

Text

An inexact bundle variant suited to column generation

Kiwiel, Krzysztof

2007

Text

More

Citation style:

iso690-author-date apa modern-language-association chicago-author-date

This page uses 'cookies'. More information