On the global minimum in a balanced circular packing problem (Q315515): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-015-0937-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2141467097 / 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: Modeling and optimization in space engineering. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Shor's \(r\)-algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearization method for inverse convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferentiable optimization and polynomial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified \(r\)-algorithm to find the global minimum of polynomial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global minimum ot the objective function in a balanced circular packing problem / rank
 
Normal rank

Latest revision as of 14:13, 12 July 2024

scientific article
Language Label Description Also known as
English
On the global minimum in a balanced circular packing problem
scientific article

    Statements

    Identifiers