Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets (Q891101): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10559-014-9675-8 / rank | |||
| 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10559-014-9675-8 / rank | |||
Normal rank | |||
Latest revision as of 07:19, 10 December 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
