A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
From MaRDI portal
Publication:6043104
DOI10.1007/s11590-023-01987-wzbMath1518.90064OpenAlexW4322721152MaRDI QIDQ6043104
Andrew C. Trapp, Pitchaya Wiratchotisatian
Publication date: 4 May 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-023-01987-w
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Best subset selection via a modern optimization lens
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- A review of recent advances in global optimization
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
- Models for representing piecewise linear cost functions
- The nonlinear knapsack problem - algorithms and applications
- A polyhedral branch-and-cut approach to global optimization
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- Incremental and encoding formulations for mixed integer programming
- Nonlinear integer programming
- Using Piecewise Linear Functions for Solving MINLPs
- An Algorithmic Framework for MINLP with Separable Non-Convexity
- A Superior Representation Method for Piecewise Linear Functions
- Proofs of Power Sum and Binomial Coefficient Congruences Via Pascal’s Identity
- Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Johann Faulhaber and Sums of Powers
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Branching and bounds tighteningtechniques for non-convex MINLP
- A Parallel Projection for the Multicommodity Network Model
- An Automatic Method for Solving Discrete Programming Problems
- A finite algorithm for concave minimization over a polyhedron
- Quadratic knapsack problems
- A specialization of the convex simplex method to cubic programming
- Technical Note—Allocation of Effort Resources among Competing Activities
- Global optimization using special ordered sets
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A hybrid approach to discrete mathematical programming
- Branch and Bound Methods for Mathematical Programming Systems
- An algorithm and new penalties for concave integer minimization over a polyhedron
- The Nonlinear Resource Allocation Problem
- Base-2 Expansions for Linearizing Products of Functions of Discrete Variables
- A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
- Linear Reformulation of Polynomial Discrete Programming for Fast Computation
- A pegging algorithm for the nonlinear resource allocation problem
