New results on the equivalence between zero-one programming and continuous concave programming
- 5 March 2009
- journal article
- Published by Springer Nature in Optimization Letters
- Vol. 3 (3) , 377-386
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Continuous Approaches for Solving Discrete Optimization Problems2006
- Constructing test functions for global optimization using continuous formulations of graph problemsOptimization Methods and Software, 2005
- Finding independent sets in a graph using continuous multivariable polynomial formulationsJournal of Global Optimization, 2001
- Machine Learning via Polyhedral Concave Minimization1996
- An exact penalty approach for solving a class of minimization problems with boolean variablesOptimization, 1988
- Penalty formulation for zero-one nonlinear programmingDiscrete Applied Mathematics, 1987
- Constrained Global Optimization: Algorithms and Applications1987
- Penalty for zero–one integer equivalent problemMathematical Programming, 1982
- Convex Analysis1970
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear ConstraintsOperations Research, 1969