Nonlinear Integer Programming
From MaRDI portal
Publication:3565244
DOI10.1007/978-3-540-68279-0_15zbMATH Open1187.90270arXiv0906.5171OpenAlexW3105187766MaRDI QIDQ3565244FDOQ3565244
Robert Weismantel, Raymond Hemmecke, Matthias Köppe, Jon Lee
Publication date: 3 June 2010
Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0906.5171
Cited In (37)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Nonlinear integer goal programming
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Title not available (Why is that?)
- Binary Optimal Control of Single-Flux-Quantum Pulse Sequences
- Outer approximation for integer nonlinear programs via decision diagrams
- Compact quadratizations for pseudo-Boolean functions
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport
- Berge-acyclic multilinear 0-1 optimization problems
- A class of valid inequalities for multilinear 0-1 optimization problems
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Optimizing a multi-stage production/inventory system by DC programming based approaches
- Optimal rank-sparsity decomposition
- Title not available (Why is that?)
- DC programming approaches for discrete portfolio optimization under concave transaction costs
- Ameso optimization: a relaxation of discrete midpoint convexity
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Solving MIPs via scaling-based augmentation
- Dual mean field search for large scale linear and quadratic knapsack problems
- Parameterized shifted combinatorial optimization
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- Integer programming in parameterized complexity: five miniatures
- Complex and quaternionic optimization
- A hybrid artificial immune network for detecting communities in complex networks
- Automata for Analysing Service Contracts
- Nonlinear integer bilevel programming
- When is rounding allowed in integer nonlinear optimization?
- A Numerical Method for Solving Quadratic Integer Programming Problem
- A method for convex black-box integer global optimization
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
- Discrete Midpoint Convexity
- Regularized optimization methods for convex MINLP problems
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)
