An approximate algorithm for nonlinear integer programming (Q5906393): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods and applications: A categorized survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: There Cannot be any Algorithm for Integer Programming with Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monte-Carlo approach for 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate algorithm for nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filled function method for finding a global minimizer of a function of several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous approach to nonlinear integer programming / rank
 
Normal rank

Latest revision as of 20:14, 28 May 2024

scientific article; zbMATH DE number 1311186
Language Label Description Also known as
English
An approximate algorithm for nonlinear integer programming
scientific article; zbMATH DE number 1311186

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references