New results on the equivalence between zero-one programming and continuous concave programming
From MaRDI portal
Publication:839801
DOI10.1007/s11590-009-0117-xzbMath1170.90438MaRDI QIDQ839801
Publication date: 3 September 2009
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-009-0117-x
Related Items
A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems, Continuous reformulations for zero-one programming problems, Convergence of a continuous approach for zero-one programming problems, Exact penalty functions for nonlinear integer programming problems, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, An exact penalty global optimization approach for mixed-integer programming problems, A new penalty parameter for linearly constrained 0--1 quadratic programming problems, An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations, Improved penalty algorithm for mixed integer PDE constrained optimization problems, Feasibility Pump-like heuristics for mixed integer problems, Continuous quadratic programming formulations of optimization problems on graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concave programming for minimizing the zero-norm over polyhedral sets
- Penalty formulation for zero-one nonlinear programming
- Constrained global optimization: algorithms and applications
- Penalty parameter for linearly constrained 0--1 quadratic programming
- Penalty for zero–one integer equivalent problem
- An exact penalty approach for solving a class of minimization problems with boolean variables
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Convex Analysis
- Constructing test functions for global optimization using continuous formulations of graph problems
- Introduction to global optimization.
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
