An exact penalty function approach for nonlinear integer programming problems
From MaRDI portal
Publication:580179
DOI10.1016/S0377-2217(86)80006-6zbMath0625.90061OpenAlexW2089368188MaRDI QIDQ580179
Publication date: 1986
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(86)80006-6
relaxationresource allocationquadratic assignmentpenalty functionquadratic knapsacksubmodular optimization
Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30)
Related Items (8)
An exact algorithm for graph partitioning ⋮ Logarithmic-exponential penalty formulation for integer programming ⋮ General exact penalty functions in integer programming ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ A revised Taha's algorithm for polynomial 0-1 programming ⋮ Exact penalty function and asymptotic strong nonlinear duality in integer programming ⋮ Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems
Cites Work
- Unnamed Item
- The indefinite zero-one quadratic problem
- An improved enumerative algorithm for solving quadratic zero-one programming
- A branch and search algorithm for a class of nonlinear knapsack problems
- Unconstrained quadratic bivalent programming problem
- Unit integer quadratic binary programming
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- Integer resource allocations with the objective function separable into pairs of variables
- A bound and bound algorithm for the zero-one multiple knapsack problem
- An efficient branch and bound algorithm to solve the quadratic integer programming problem
- Penalty functions in linear integer programming
- Covering Relaxation for Positive 0-1 Polynomial Programs
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Quadratic knapsack problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- An Algorithm for Nonlinear Knapsack Problems
- An analysis of approximations for maximizing submodular set functions—I
- Duality in Discrete Programming: II. The Quadratic Case
- On the Maximization of a Pseudo-Boolean Function
This page was built for publication: An exact penalty function approach for nonlinear integer programming problems
