Iterative bundle-based decomposition for large-scale nonseparable convex optimization

Article Abstract:

An approach is developed for solving large-scale convex optimization problem with linear block-angular constraints. An iterative Bundle-based decomposition (BBD) algorithm is derived under a smoothness condition on the objective function. The objective function is then estimated as a separable quadratic function and the BBD algorithm is applied to the estimated separable problem in each iteration.

Models, Mathematical optimization, Optimization theory, Nonlinear programming, Convex programming

---

Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication network

Article Abstract:

Application of heuristics to solve Steiner tree problem pertaining to point-to-multipoint network flow, subject to optimality conditions, is described. Applicability of this solution for multicast routing in telecommunication networks is discussed.

South Korea, Methods, Communications circuits, Multicasting

---

Solving real car sequencing problems with ant colony optimization

Article Abstract:

A study attempts to solve sequencing problems in an automobile assembly unit using mathematical models. A metaheuristic is suggested for the problem.

Canada, Product quality, Quality management, Assembly-line methods, Assembly lines, Sequential machine theory

Similar abstracts:

• Abstracts: Directional decomposition heuristic for a linear machine-cell location problem. An evolutionary heuristic for the index tracking problem
• Abstracts: Iterative methods based on splitting for stochastic automata networks. Lumpable continuous-time stochastic automata networks
• Abstracts: Multi-period capacity expansion for a local access telecommunications network. New formulations and solution procedures for the hop constrained network design problem
• Abstracts: An alternative to safety stock policies for multi-level rolling schedule MRP problems. Randomized multi-level lot-sizing heuristics for general product structures
• Abstracts: Connectedness of efficient solutions in multiple criteria combinatorial optimization. Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phase approach

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.