A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hanif D. Sherali / rank
Normal rank
 
Property / author
 
Property / author: Hanif D. Sherali / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized bilinear programming. I: Models, applications and linear programming relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear 0–1 programming: I. Linearization techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear 0–1 programming: II. Dominance relations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3494393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:32, 15 May 2024

scientific article
Language Label Description Also known as
English
A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
scientific article

    Statements

    A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (English)
    0 references
    0 references
    0 references
    0 references
    13 August 1992
    0 references
    0 references
    multilinear programs
    0 references
    continuous polynomial programming
    0 references
    lower bounds
    0 references
    branch and bound
    0 references