Penalty formulation for zero-one nonlinear programming
From MaRDI portal
Publication:1091262
DOI10.1016/0166-218X(87)90073-4zbMath0622.90059MaRDI QIDQ1091262
Bahman Kalantari, J. Ben Rosen
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (10)
New results on the equivalence between zero-one programming and continuous concave programming ⋮ Continuous quadratic programming formulations of optimization problems on graphs ⋮ Manifold relaxations for integer programming ⋮ An exact penalty global optimization approach for mixed-integer programming problems ⋮ Continuous reformulations for zero-one programming problems ⋮ On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems ⋮ Unconstrained 0-1 nonlinear programming: A nondifferentiable approach ⋮ A revised Taha's algorithm for polynomial 0-1 programming ⋮ Exact penalty functions for nonlinear integer programming problems ⋮ On duality for Boolean programming
Cites Work
- Penalty for zero–one integer equivalent problem
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- Methods of Nonlinear 0-1 Programming
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Unnamed Item
- Unnamed Item
This page was built for publication: Penalty formulation for zero-one nonlinear programming
