On the impact of running intersection inequalities for globally solving polynomial optimization problems
From MaRDI portal
(Redirected from Publication:2195679)
Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 2068068 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A class of valid inequalities for multilinear 0-1 optimization problems
- A convex envelope formula for multilinear functions
- A hybrid LP/NLP paradigm for global optimization relaxations
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A polyhedral branch-and-cut approach to global optimization
- A polyhedral study of binary polynomial programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Analysis of bounds for multilinear functions
- Benchmarking optimization software with performance profiles.
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Concave extensions for nonlinear 0-1 maximization problems
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
- Experiments in quadratic 0-1 programming
- Explicit convex and concave envelopes through polyhedral subdivisions
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex problems with multilinear intermediates
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- LP formulations for polynomial optimization problems
- On decomposability of multilinear sets
- On the Desirability of Acyclic Database Schemes
- Quadratic reformulations of nonlinear binary optimization problems
- Reducibility among combinatorial problems
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The global solver in the LINDO API
- The multilinear polytope for acyclic hypergraphs
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
Cited in
(11)- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- A new framework to relax composite functions in nonlinear programs
- Efficient linear reformulations for binary polynomial optimization problems
- A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- The Running Intersection Relaxation of the Multilinear Polytope
- A polyhedral study of lifted multicuts
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
- Complexity of optimizing over the integers
This page was built for publication: On the impact of running intersection inequalities for globally solving polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2195679)
