Extending a continuous RLT-based algorithm to mixed-integer polynomial problems
From MaRDI portal
Cites work
- A branch-and-reduce approach to global optimization
- A class of valid inequalities for multilinear 0-1 optimization problems
- A Decomposition Algorithm for a Discrete Location-Allocation Problem
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A hybrid LP/NLP paradigm for global optimization relaxations
- A Modeling Language for Mathematical Programming
- A note on performance profiles for benchmarking software
- A polyhedral study of binary polynomial programs
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Benchmarking optimization software with performance profiles.
- Branching and bounds tighteningtechniques for non-convex MINLP
- Branching rules revisited
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Domain reduction techniques for global NLP and MINLP optimization
- Efficient linear reformulations for binary polynomial optimization problems
- Efficient separation of RLT cuts for implicit and explicit bilinear terms
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- JuMP 1.0: recent improvements to a modeling language for mathematical optimization
- Learning for Spatial Branching: An Algorithm Selection Approach
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- Mixed-integer nonlinear optimization
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- On the complexity of binary polynomial optimization over acyclic hypergraphs
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
- QPLIB: a library of quadratic programming instances
- Reduced RLT representations for nonconvex polynomial programming problems
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
- RLT: A unified approach for discrete and continuous nonconvex optimization
- Simple odd -cycle inequalities for binary polynomial optimization
- The global solver in the LINDO API
- The multilinear polytope for acyclic hypergraphs
- The Running Intersection Relaxation of the Multilinear Polytope
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
This page was built for publication: Extending a continuous RLT-based algorithm to mixed-integer polynomial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305913)
