NP-Hard Problems and Test Problems For Global Concave Minimization Methods
Yugoslav journal of operations research, Tome 1 (1991) no. 1, p. 45 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

This paper presents a new method of obtaining hard test problems for global concave minimization problems. The method starts from a three—satisfiability type of problem and it transforms it into a minimization problem over the unit cube with quadratic or cubic concave objective function. An alternative proof of the NP—hardness of such problems is also given.
Keywords: NP-hard, concave, global optimization, complexity
@article{YJOR_1991_1_1_a3,
     author = {Miroslav D. A\v{s}i\'c and Vera V. Kova\v{c}evi\'c-Vuj\v{c}i\'c},
     title = {NP-Hard {Problems} and {Test} {Problems}  {For} {Global} {Concave} {Minimization} {Methods}},
     journal = {Yugoslav journal of operations research},
     pages = {45 },
     publisher = {mathdoc},
     volume = {1},
     number = {1},
     year = {1991},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_1991_1_1_a3/}
}
TY  - JOUR
AU  - Miroslav D. Ašić
AU  - Vera V. Kovačević-Vujčić
TI  - NP-Hard Problems and Test Problems  For Global Concave Minimization Methods
JO  - Yugoslav journal of operations research
PY  - 1991
SP  - 45 
VL  - 1
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/YJOR_1991_1_1_a3/
LA  - en
ID  - YJOR_1991_1_1_a3
ER  - 
%0 Journal Article
%A Miroslav D. Ašić
%A Vera V. Kovačević-Vujčić
%T NP-Hard Problems and Test Problems  For Global Concave Minimization Methods
%J Yugoslav journal of operations research
%D 1991
%P 45 
%V 1
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/YJOR_1991_1_1_a3/
%G en
%F YJOR_1991_1_1_a3
Miroslav D. Ašić; Vera V. Kovačević-Vujčić. NP-Hard Problems and Test Problems  For Global Concave Minimization Methods. Yugoslav journal of operations research, Tome 1 (1991) no. 1, p. 45 . http://geodesic.mathdoc.fr/item/YJOR_1991_1_1_a3/