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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90215-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028104204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer solutions of systems of quadratic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming / 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: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Balasian-Based Algorithm for Zero-One Polynomial Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm of internal feasible directions for linear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods and applications: A categorized survey / rank
 
Normal rank

Latest revision as of 15:59, 22 May 2024

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

    Statements

    Identifiers