On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINDOGlobal / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: POLIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ANTIGONE / rank
 
Normal rank
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.1007/s12532-019-00169-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964874319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic reformulations of nonlinear binary optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex problems with multilinear intermediates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP Formulations for Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods / 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: Concave extensions for nonlinear 0-1 maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of valid inequalities for multilinear 0-1 optimization problems / 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: On decomposability of multilinear sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multilinear Polytope for Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility Among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid LP/NLP paradigm for global optimization relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The global solver in the LINDO API / 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: Q4464676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex envelope formula for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of bounds for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets / 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: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong valid inequalities for orthogonal disjunctions and bilinear covering sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit convex and concave envelopes through polyhedral subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach for nonconvex quadratic programming problems with box constraints / rank
 
Normal rank

Latest revision as of 09:59, 23 July 2024

scientific article
Language Label Description Also known as
English
On the impact of running intersection inequalities for globally solving polynomial optimization problems
scientific article

    Statements

    On the impact of running intersection inequalities for globally solving polynomial optimization problems (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    branch-and-cut
    0 references
    polynomial optimization
    0 references
    running-intersection inequalities
    0 references
    multilinear polytope
    0 references
    separation algorithm
    0 references
    mixed-integer nonlinear optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references