Concave extensions for nonlinear 0-1 maximization problems (Q689146): 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 equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems / 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: Recognition problems for special classes of polynomials in 0-1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The basic algorithm for pseudo-Boolean programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Successive Underestimation Method for Concave Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Generalized Covering Relaxation for 0-1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3200885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unimodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality for polynomial 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of functions of 0-1 variables and applications to combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alpha-balanced graphs and matrices and GF(3)-representability of matroids / rank
 
Normal rank

Revision as of 10:32, 22 May 2024

scientific article
Language Label Description Also known as
English
Concave extensions for nonlinear 0-1 maximization problems
scientific article

    Statements

    Concave extensions for nonlinear 0-1 maximization problems (English)
    0 references
    26 September 1994
    0 references
    The problem considered is one of maximizing a real-valued function over the binary hypercube. The main result gives the necessary and sufficient conditions for a suitably defined LP relaxation to solve the original problem. The conditions are connected with the integrality of the corresponding polytope.
    0 references
    nonlinear 0-1 optimization
    0 references
    concave extension
    0 references
    concave envelope
    0 references
    linearization
    0 references
    integral polyhedron
    0 references
    balanced matrix
    0 references
    binary hypercube
    0 references
    LP relaxation
    0 references
    0 references
    0 references

    Identifiers