A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5339894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer nonlinear programming tools: a practical overview / 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: Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: L’algebre de Boole et ses applications en recherche operationnelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming 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: Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes for RLT relaxations of mixed 0-1 polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Study of Binary Polynomial Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concave extensions for nonlinear 0-1 maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of bounds for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on the strength of relaxations of multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid optimisation problems with nested non-linear monomials in the objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization with one quadratic term: spanning trees and forests / rank
 
Normal rank

Latest revision as of 16:08, 15 July 2024

scientific article
Language Label Description Also known as
English
A class of valid inequalities for multilinear 0-1 optimization problems
scientific article

    Statements

    A class of valid inequalities for multilinear 0-1 optimization problems (English)
    0 references
    0 references
    24 May 2018
    0 references
    multilinear binary optimization
    0 references
    pseudo-Boolean optimization
    0 references
    integer nonlinear programming
    0 references
    standard linearization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers