A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104): Difference between revisions

Latest revision as of 01:27, 1 August 2024

scientific article; zbMATH DE number 7682173

Language	Label	Description	Also known as
English	A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables	scientific article; zbMATH DE number 7682173

Statements

instance of

scholarly article

0 references

title

A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (English)

0 references

author

Pitchaya Wiratchotisatian

0 references

0 references

0 references

4 May 2023

0 references

zbMATH Keywords

polynomial integer optimization

0 references

reformulation

0 references

linearization

0 references

integer optimization

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11590-023-01987-w

0 references

cites work

Base-2 Expansions for Linearizing Products of Functions of Discrete Variables

0 references

\(\alpha BB\): A global optimization method for general constrained nonconvex problems

0 references

Q5608997

0 references

Branch and Bound Methods for Mathematical Programming Systems

0 references

Global optimization using special ordered sets

0 references

Branching and bounds tighteningtechniques for non-convex MINLP

0 references

A finite algorithm for concave minimization over a polyhedron

0 references

Best subset selection via a modern optimization lens

0 references

The Nonlinear Resource Allocation Problem

0 references

The nonlinear knapsack problem - algorithms and applications

0 references

A pegging algorithm for the nonlinear resource allocation problem

0 references

An algorithm and new penalties for concave integer minimization over a polyhedron

0 references

An Algorithmic Framework for MINLP with Separable Non-Convexity

0 references

Q4833806

0 references

A review of recent advances in global optimization

0 references

Quadratic knapsack problems

0 references

Using Piecewise Linear Functions for Solving MINLPs

0 references

Q4421360

0 references

A specialization of the convex simplex method to cubic programming

0 references

A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures

0 references

Models for representing piecewise linear cost functions

0 references

A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization

0 references

Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs

0 references

Johann Faulhaber and Sums of Powers

0 references

An Automatic Method for Solving Discrete Programming Problems

0 references

Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables

0 references

Nonlinear integer programming

0 references

A Superior Representation Method for Piecewise Linear Functions

0 references

Linear Reformulation of Polynomial Discrete Programming for Fast Computation

0 references

Technical Note—Allocation of Effort Resources among Competing Activities

0 references

Proofs of Power Sum and Binomial Coefficient Congruences Via Pascal’s Identity

0 references

A hybrid approach to discrete mathematical programming

0 references

Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

0 references

A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems

0 references

A branch-and-reduce approach to global optimization

0 references

A Parallel Projection for the Multicommodity Network Model

0 references

Global optimization of mixed-integer nonlinear programs: a theoretical and computational study

0 references

A polyhedral branch-and-cut approach to global optimization

0 references

Q5342287

0 references

Modeling disjunctive constraints with a logarithmic number of binary variables and constraints

0 references

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions

0 references

Incremental and encoding formulations for mixed integer programming

0 references

Identifiers

zbMATH Open document ID

1518.90064

0 references

DOI

10.1007/s11590-023-01987-w

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6043104

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