An exact penalty function approach for nonlinear integer programming problems
From MaRDI portal
Publication:580179
DOI10.1016/S0377-2217(86)80006-6zbMATH Open0625.90061OpenAlexW2089368188MaRDI QIDQ580179FDOQ580179
Authors: Marius Sinclair 
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
Recommendations
- Exact penalty functions for nonlinear integer programming problems
- General exact penalty functions in integer programming
- Penalty for zero–one integer equivalent problem
- An exact penalty function method for solving linear and integer linear programming problems
- Multiplicative method for exact penalty functions for linear and integer linear programming problems
quadratic knapsackresource allocationpenalty functionrelaxationquadratic assignmentsubmodular optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Integer programming (90C10)
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- Quadratic knapsack problems
- Title not available (Why is that?)
- An analysis of approximations for maximizing submodular set functions—I
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- The indefinite zero-one quadratic problem
- Unconstrained quadratic bivalent programming problem
- An improved enumerative algorithm for solving quadratic zero-one programming
- Duality in Discrete Programming: II. The Quadratic Case
- A branch and search algorithm for a class of nonlinear knapsack problems
- Covering Relaxation for Positive 0-1 Polynomial Programs
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- A bound and bound algorithm for the zero-one multiple knapsack problem
- Unit integer quadratic binary programming
- Integer resource allocations with the objective function separable into pairs of variables
- An efficient branch and bound algorithm to solve the quadratic integer programming problem
- Penalty functions in linear integer programming
- An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
- An Algorithm for Nonlinear Knapsack Problems
- On the Maximization of a Pseudo-Boolean Function
Cited In (20)
- Penalty formulation for zero-one nonlinear programming
- General exact penalty functions in integer programming
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Multiplicative method for exact penalty functions for linear and integer linear programming problems
- Exact penalty functions for nonlinear integer programming problems
- Penalty computations for the set partitioning problem
- Exact penalty function and asymptotic strong nonlinear duality in integer programming
- Exact penalty functions in linear and integer linear programming
- A discrete dynamic convexized method for nonlinear integer programming
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming
- An exact penalty approach for solving a class of minimization problems with boolean variables
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Title not available (Why is that?)
- An exact penalty function method for solving linear and integer linear programming problems
- An exact penalty-Lagrangian approach for large-scale nonlinear programming
- Logarithmic-exponential penalty formulation for integer programming
- An exact algorithm for graph partitioning
- A revised Taha's algorithm for polynomial 0-1 programming
- An exact penalty global optimization approach for mixed-integer programming problems
This page was built for publication: An exact penalty function approach for nonlinear integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580179)
