New results on the equivalence between zero-one programming and continuous concave programming

Optimization Letters

Volumn 3, Issue 3, 2009, Pages 377-386

  Rinaldi, Francesco ^a  

^a CNR   (Italy)

Author keywords

Concave functions; Continuous programming; Exact penalty functions; Zero one programming

Indexed keywords

COMBINATORIAL PROBLEM; CONCAVE FUNCTIONS; CONTINUOUS PROBLEMS; CONTINUOUS PROGRAMMING; EXACT PENALTY FUNCTIONS; NEW RESULTS; PENALTY FUNCTION; PROGRAMMING PROBLEM; ZERO-ONE; ZERO-ONE PROGRAMMING;

EID: 67650470600     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-009-0117-x     Document Type: Article

References (15)

1. J. Abello S. Butenko P.M. Pardalos M. Resende 2001 Finding independent sets in a graph using continuous multivariable polynomial formulations J. Glob. Optim. 21 111 137 (Pubitemid 33672364)
2. B. Balasundaram S. Butenko 2005 Constructing test functions for global optimization using continuous formulations of graph problems Optim. Methods Softw. 20 439 452
3. M. Borchardt 1988 An exact penalty approach for solving a class of minimization problems with Boolean variables Optim. 19 6 829 838
4. F. Giannessi F. Niccolucci 1976 Connections between nonlinear and integer programming problems Symp. Math. 19 161 176
5. Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization, 2nd edn. Kluwer, Dordrecht (2000)
6. B. Kalantari J.B. Rosen 1982 Penalty formulation for zero-one integer equivalent problem Math. Program. 24 229 232 (Pubitemid 13461137)
7. B. Kalantari J.B. Rosen 1987 Penalty formulation for zero-one nonlinear programming Discrete Appl. Math. 16 2 179 182 (Pubitemid 17529026)
8. Mangasarian O.L.: Machine learning via polyhedral concave minimization. In: Fischer, H., Riedmueller, B., Schaeffler, S. (eds) Applied Mathematics and Parallel Computing-Festschrift for Klaus Ritter, pp. 175-188. Physica-Verlag, Germany (1996)
9. Mangasarian, O.L.: Knapsack Feasibility as an Absolute Value Equation Solvable by Successive Linear Programming. Data Mining Institute Technical Report 08-03, September 2008. Optimization Letters (2008, to appear)
10. Pardalos P.M., Rosen J.B.: Constrained Global Optimization: algorithms and Applications. Lecture Notes in Computer Science, vol. 268. Springer, Berlin (1987)
11. Pardalos P.M., Prokopyev O.A., Busygin S.: Continuous Approaches for Solving Discrete Optimization Problems. Handbook on Modelling for Discrete Optimization, vol. 8, pp. 39-60. Springer, New York (2006)
12. M. Raghavachari 1969 On connections between zero-one integer programming and concave programming under linear constraints Oper. Res. 17 4 680 684
13. Rinaldi, F., Schoen, F., Sciandrone, M.: Concave programming for minimizing the zero-norm over polyhedral sets. Technical report RT 2/2008, Dipartimento Sistemi e Informatica, Università di Firenze. Computational Optimization and Applications (2008, to appear)
14. Rockafellar T.: Convex Analysis. Princeton University Press, Princeton (1970)
15. W.X. Zhu 2003 Penalty parameter for linearly constrained 0-1 quadratic programming J. Optim. Theory Appl. 116 1 229 239