Search for: [Subject and Keywords = Programowanie całkowitoliczbowe] OR [Subject and Keywords = Lagrangian relaxation] OR [Subject and Keywords = Nondifferentiable convex optimization] OR [Subject and Keywords = Integer programming] OR [Subject and Keywords = Bundle methods] OR [Subject and Keywords = Knapsack problems] OR [Subject and Keywords = Problem plecakowy] OR [Subject and Keywords = Cutting\-stock] OR [Subject and Keywords = Optymalizacja wypukła nieróżniczkowalna] OR [Subject and Keywords = Relaksacja lagrange'a] OR [Subject and Keywords = Rozkrój materiału] OR [Title = An inexact bundle approach to cutting\-stock problems] OR [Creator = Kiwiel, Krzysztof]

Number of results: 48

Items per page:

add all to bibliography

of 2 Next

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 Semidefinite Programming

Kiwiel, Krzysztof

2005

Text

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

Kiwiel, Krzysztof

2006

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

An Inexact Conic Bundle Variant Suited to Column Generation

Kiwiel, Krzysztof Lemarechal, Claude

2006

Text

A Proximal Bundle Method with Approximate Subgradient Linearizations

Kiwiel, Krzysztof

2004

Text

A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization

Kiwiel, Krzysztof

2006

Text

Lagrangian Relaxation Via Ballstep Subgradient Methods

Kiwiel, Krzysztof Larsson, Torbjörn Lindberg, Per

2002

Text

A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization

Kiwiel, Krzysztof

2007

Text

Bundle methods for convex minimization with partially inexact oracles

Kiwiel, Krzysztof

2009

Text

On possible fuzzy extensions to some optimization and mathematical programming models

Kacprzyk, Janusz (1947– ) Kiwiel, Krzysztof

2015

Text

An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow

Kiwiel, Krzysztof

2009

Text

An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems

Kiwiel, Krzysztof

2008

Text

The asymptotic growth of optimal solutions values of random m-constraint knapsacks

Szkatuła, Krzysztof

2001

Text

On some preliminary results of the probabilistic analysis of the two-constraint binary knapsack problem

Szkatuła, Krzysztof

2010

Text

An integer programming approach to inductive learning from examples

Kacprzyk, Janusz (1947– ) Szkatuła, Grażyna

2008

Text

An improved convergence result for the discrete gradient and secant methods for nonsmooth optimization.

Kiwiel, Krzysztof

2009

Text

Some probabilistic analysis results on the set packing problem

Szkatuła, Krzysztof

2003

Text

Probabilistic analysis of the Two-Constraint Binary Knapsack Problem : cases of small and large constraints right-hand-sides values

Szkatuła, Krzysztof

2011

Text

Random scheduling (sequencing) jobs with deadlines problem : Deadliness intervals impact on the optimal solution values behavior

Szkatuła, Krzysztof

2015

Text

Probabilistic analysis of the Two-Constraint Binary Knapsack Problem, case of small and moderate values of the constraints right-hand-sides coefficients

Szkatuła, Krzysztof

2013

Text

Filters

Number of results: 48

Contact

Address

Financing:

Project I

Project II

Partners funds

Partnership:

Website created by