Nonlinear integer programming
From MaRDI portal
Abstract: Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject to integrality requirements for the variables. This chapter is dedicated to this topic. The primary goal is a study of a simple version of general nonlinear integer problems, where all constraints are still linear. Our focus is on the computational complexity of the problem, which varies significantly with the type of nonlinear objective function in combination with the underlying combinatorial structure. Numerous boundary cases of complexity emerge, which sometimes surprisingly lead even to polynomial time algorithms. We also cover recent successful approaches for more general classes of problems. Though no positive theoretical efficiency results are available, nor are they likely to ever be available, these seem to be the currently most successful and interesting approaches for solving practical problems. It is our belief that the study of algorithms motivated by theoretical considerations and those motivated by our desire to solve practical instances should and do inform one another. So it is with this viewpoint that we present the subject, and it is in this direction that we hope to spark further research.
Recommendations
Cited in
(45)- Nonlinear integer programming algorithms: A survey
- Nonlinear integer goal programming
- Nonlinear integer bilevel programming
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
- Dual mean field search for large scale linear and quadratic knapsack problems
- Solving MIPs via scaling-based augmentation
- A class of valid inequalities for multilinear 0-1 optimization problems
- The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs
- Berge-acyclic multilinear 0-1 optimization problems
- Outer approximation for integer nonlinear programs via decision diagrams
- A method for convex black-box integer global optimization
- Complex and quaternionic optimization
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Compact quadratizations for pseudo-Boolean functions
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- Nonlinear integer programming
- When is rounding allowed in integer nonlinear optimization?
- A hybrid artificial immune network for detecting communities in complex networks
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- Ameso optimization: a relaxation of discrete midpoint convexity
- Integer programming in parameterized complexity: five miniatures
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
- Automata for analysing service contracts
- On the complexity of nonlinear mixed-integer optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Nonlinear integer programming for various forms of constraints
- scientific article; zbMATH DE number 1264409 (Why is no real title available?)
- scientific article; zbMATH DE number 562287 (Why is no real title available?)
- Optimizing a multi-stage production/inventory system by DC programming based approaches
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- scientific article; zbMATH DE number 1383429 (Why is no real title available?)
- Optimal rank-sparsity decomposition
- Binary optimal control of single-flux-quantum pulse sequences
- Discrete midpoint convexity
- Regularized optimization methods for convex MINLP problems
- Global optimization of mixed-integer ODE constrained network problems using the example of stationary gas transport
- A numerical method for solving quadratic integer programming problem
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- DC programming approaches for discrete portfolio optimization under concave transaction costs
- Maximum satisfiability formulations for nonlinear integer programming
- A fillmore theorem-based approach to reduce zero sensitivity in discrete-time LTI controllers with infinite lifespan in homomorphic encrypted control systems
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- Batch Sequential Experimental Design for Calibration of Stochastic Simulation Models
This page was built for publication: Nonlinear integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565244)
