scientific article; zbMATH DE number 4155307
From MaRDI portal
zbMATH Open0704.49029MaRDI QIDQ3483926FDOQ3483926
Authors: Piotr Tatjewski 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
- New dual-type decomposition algorithm for non-convex separable optimization problems
- scientific article; zbMATH DE number 4145673
- scientific article; zbMATH DE number 4091189
- scientific article; zbMATH DE number 147107
- New decomposition and convexification algorithm for nonconvex large-scale primal-dual optimization
Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Decomposition methods (49M27)
Cited In (7)
- New dual-type decomposition algorithm for non-convex separable optimization problems
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complete decomposition algorithm for nonconvex separable optimization problems and applications
- Title not available (Why is that?)
- A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3483926)
