Partitioning procedures for solving mixed-variables programming problems (Q1131201): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3250135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277015 / rank
 
Normal rank

Latest revision as of 20:05, 11 June 2024

scientific article
Language Label Description Also known as
English
Partitioning procedures for solving mixed-variables programming problems
scientific article

    Statements