Pages that link to "Item:Q580179"
From MaRDI portal
The following pages link to An exact penalty function approach for nonlinear integer programming problems (Q580179):
Displaying 14 items.
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming (Q1017442) (← links)
- Multiplicative method for exact penalty functions for linear and integer linear programming problems (Q1287451) (← links)
- Exact penalty functions in linear and integer linear programming (Q1319768) (← links)
- Exact penalty function and asymptotic strong nonlinear duality in integer programming (Q1780321) (← links)
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming (Q1934641) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Logarithmic-exponential penalty formulation for integer programming (Q1961727) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- An exact penalty-Lagrangian approach for large-scale nonlinear programming (Q2996800) (← links)
- An exact penalty function method with global convergence properties for nonlinear programming problems (Q3768690) (← links)
- (Q4252704) (← links)
- A revised Taha's algorithm for polynomial 0-1 programming (Q5426969) (← links)
- General exact penalty functions in integer programming (Q5717384) (← links)
