期刊： JOURNAL OF GLOBAL OPTIMIZATION, 2021; 80 (3)
In this paper, we consider the wireless sensor network in which the power of each sensor is adjustable. Given a set of sensors and a set of targets, w......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, 2021; 80 (3)
This paper presents a novel partially distributed outer approximation algorithm, named PaDOA, for solving a class of structured mixed integer convex p......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, 2021; 80 (4)
We focus on a special nonconvex and nonsmooth composite function, which is the sum of the smooth weakly convex component functions and a proper lower ......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, 2021; 80 (3)
This study proposes a mixed-integer nonconvex programming (MINP) model for the winner determination problem (WDP) considering two discount functions i......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, 2021; 80 (3)
Arising from practical problems such as in sensor placement and influence maximization in social network, submodular and non-submodular maximization o......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, 2021; 80 (4)
An interesting observation is that most pairs of weakly homogeneous mappings do not possess strongly monotonic property, which is one of the key condi......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, ; ()
This paper aims to find efficient solutions to a multi-objective optimization problem (MP) with convex polynomial data. To this end, a hybrid method, ......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, ; ()
In this paper, we concentrate on generating cutting planes for the unsplittable capacitated network design problem. We use the unsplittable flow arc-s......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, ; ()
We propose a convex quadratic programming (CQP) relaxation for multi-ball constrained quadratic optimization (MB). (CQP) is shown to be equivalent to ......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, ; ()
This paper is dedicated to solving a nonsmooth second-order cone complementarity problem, in which the mapping is assumed to be locally Lipschitz cont......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, ; ()
The max-k-cut problem is one of the most well-known combinatorial optimization problems. In this paper, we design an efficient branch-and-bound algori......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, ; ()
In this paper, a power penalty approximation method is proposed for solving a mixed quasilinear elliptic complementarity problem. The mixed complement......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, 2020; 78 (4)
The selection and development of high-end weapon equipment is a strategic issue for nations. High-end weapon equipment portfolio selection (HWEPS) has......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, 2020; 78 (4)
This paper investigates a parallel-machine group scheduling problem where non-identical jobs with arbitrary sizes and inclusive processing set restric......
期刊： JOURNAL OF GLOBAL OPTIMIZATION, 2020; 78 (4)
Parallel-batching processing and job deterioration are universal in the real industry. Scholars have deeply investigated the problem of parallel-batch......
