An exact penalty function approach for nonlinear integer programming problems
From MaRDI portal
Publication:580179
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
Cites work
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- A bound and bound algorithm for the zero-one multiple knapsack problem
- A branch and search algorithm for a class of nonlinear knapsack problems
- An Algorithm for Nonlinear Knapsack Problems
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
- An analysis of approximations for maximizing submodular set functions—I
- An efficient branch and bound algorithm to solve the quadratic integer programming problem
- An improved enumerative algorithm for solving quadratic zero-one programming
- Covering Relaxation for Positive 0-1 Polynomial Programs
- Duality in Discrete Programming: II. The Quadratic Case
- Integer resource allocations with the objective function separable into pairs of variables
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- On the Maximization of a Pseudo-Boolean Function
- Penalty functions in linear integer programming
- Quadratic knapsack problems
- The indefinite zero-one quadratic problem
- Unconstrained quadratic bivalent programming problem
- Unit integer quadratic binary programming
Cited in
(21)- Exact penalty functions for nonlinear integer programming problems
- A discrete dynamic convexized method for nonlinear integer programming
- Penalty formulation for zero-one nonlinear programming
- Multiplicative method for exact penalty functions for linear and integer linear programming problems
- An exact penalty function method for solving linear and integer linear programming problems
- General exact penalty functions in integer programming
- Penalty computations for the set partitioning problem
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- A revised Taha's algorithm for polynomial 0-1 programming
- An exact penalty-Lagrangian approach for large-scale nonlinear programming
- An exact algorithm for graph partitioning
- scientific article; zbMATH DE number 1306849 (Why is no real title available?)
- An exact penalty global optimization approach for mixed-integer programming problems
- Logarithmic-exponential penalty formulation for integer programming
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Exact penalty function and asymptotic strong nonlinear duality in integer programming
- An exact penalty approach for solving a class of minimization problems with boolean variables
- Exact penalty functions in linear and integer linear programming
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)
