Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets

DOI10.1007/S10559-014-9675-8zbMATH Open1327.49003OpenAlexW1986010448MaRDI QIDQ891101FDOQ891101

Authors: E. M. Kiseleva, L. S. Koriashkina, T. A. Shevchenko 

Publication date: 16 November 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-014-9675-8

Recommendations

• Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional
• The features of solving of the set partitioning problems with moving boundaries between subsets
• scientific article; zbMATH DE number 4125186
• Solving a two-stage continuous-discrete problem of optimal partition-allocation with a given position of the centers of subsets
• Analysis of algorithms for a class of continuous partition problems

zbMATH Keywords

optimal controlnumerical algorithmdynamic systemsLagrange functionalnondifferentiable optimization methodoptimal set partitioning

Mathematics Subject Classification ID

Control problems involving ordinary differential equations (34H05) Existence theories for optimal control problems involving ordinary differential equations (49J15) Optimality conditions for problems involving ordinary differential equations (49K15) Control/observation systems governed by ordinary differential equations (93C15)

Cites Work

• Algorithms of nondifferentiable optimization: development and application
• Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets
• \(r\)-algorithms and ellipsoids
• An approximate method of ellipsoids

Cited In (8)

• Partitioning a finite set by a dynamic programming method
• The features of solving of the set partitioning problems with moving boundaries between subsets
• Optimal placement of irradiation sources in the planning of radiotherapy: mathematical models and methods of solving
• Title not available (Why is that?)
• Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets
• Multi-phase dynamic constraint aggregation for set partitioning type problems
• Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional
• Solving \(k\)-center problems involving sets based on optimization techniques

This page was built for publication: Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891101)