Nonlinear Integer Programming

DOI10.1007/978-3-540-68279-0_15zbMath1187.90270arXiv0906.5171OpenAlexW3105187766MaRDI QIDQ3565244

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)

Full work available at URL: https://arxiv.org/abs/0906.5171

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Related Items (33)

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 ⋮ Binary Optimal Control of Single-Flux-Quantum Pulse Sequences ⋮ Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Solving MIPs via scaling-based augmentation ⋮ Ameso optimization: a relaxation of discrete midpoint convexity ⋮ An overview of MINLP algorithms and their implementation in Muriqui optimizer ⋮ Integer programming in parameterized complexity: five miniatures ⋮ Two linear approximation algorithms for convex mixed integer nonlinear programming ⋮ Discrete Midpoint Convexity ⋮ Generating valid linear inequalities for nonlinear programs via sums of squares ⋮ Optimizing a multi-stage production/inventory system by DC programming based approaches ⋮ Optimal rank-sparsity decomposition ⋮ Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON ⋮ Berge-acyclic multilinear 0-1 optimization problems ⋮ A class of valid inequalities for multilinear 0-1 optimization problems ⋮ Regularized optimization methods for convex MINLP problems ⋮ Outer-approximation algorithms for nonsmooth convex MINLP problems ⋮ Outer approximation for integer nonlinear programs via decision diagrams ⋮ Parameterized shifted combinatorial optimization ⋮ 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 ⋮ DC programming approaches for discrete portfolio optimization under concave transaction costs ⋮ When is rounding allowed in integer nonlinear optimization? ⋮ A hybrid artificial immune network for detecting communities in complex networks ⋮ A method for convex black-box integer global optimization ⋮ A Numerical Method for Solving Quadratic Integer Programming Problem ⋮ Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming ⋮ Automata for Analysing Service Contracts ⋮ Compact quadratizations for pseudo-Boolean functions ⋮ Complex and quaternionic optimization ⋮ Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem

This page was built for publication: Nonlinear Integer Programming