Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets (Q891101): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: \(r\)-algorithms and ellipsoids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms of nondifferentiable optimization: development and application / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An approximate method of ellipsoids / rank | |||
Normal rank | |||
Revision as of 01:31, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets |
scientific article |
Statements
Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets (English)
0 references
16 November 2015
0 references
optimal set partitioning
0 references
dynamic systems
0 references
optimal control
0 references
Lagrange functional
0 references
nondifferentiable optimization method
0 references
numerical algorithm
0 references
