Most Download

Published in last 1 year| In last 2 years| In last 3 years| All| Most Downloaded in Recent Month | Most Downloaded in Recent Year|

Published in last 1 year

Please wait a minute...


For Selected: Download Citations EndNote Ris BibTeX Toggle Thumbnails

Select

The Rate of Convergence of Augmented Lagrangian Method for Minimax Optimization Problems with Equality Constraints Yu-Hong Dai, Li-Wei Zhang Journal of the Operations Research Society of China    2024, 12 (2): 265-297.   DOI: 10.1007/s40305-022-00439-z Abstract （127）      PDF       Knowledge map    Save The augmented Lagrangian function and the corresponding augmented Lagrangian method are constructed for solving a class of minimax optimization problems with equality constraints. We prove that, under the linear independence constraint qualification and the second-order sufficiency optimality condition for the lower level problem and the second-order sufficiency optimality condition for the minimax problem, for a given multiplier vector μ, the rate of convergence of the augmented Lagrangian method is linear with respect to ||μ - μ*|| and the ratio constant is proportional to 1/c when the ratio ||μ - μ*/c is small enough, where c is the penalty parameter that exceeds a threshold c* > 0 and μ* is the multiplier corresponding to a local minimizer. Moreover, we prove that the sequence of multiplier vectors generated by the augmented Lagrangian method has at least Q-linear convergence if the sequence of penalty parameters {ck} is bounded and the convergence rate is superlinear if {ck} is increasing to infinity. Finally, we use a direct way to establish the rate of convergence of the augmented Lagrangian method for the minimax problem with a quadratic objective function and linear equality constraints. Reference | Related Articles | Metrics | Comments（0）

Select

The Perturbation Bound of the Extended Vertical Linear Complementarity Problem Shi-Liang Wu, Wen Li, He-Hui Wang Journal of the Operations Research Society of China    2024, 12 (3): 601-625.   DOI: 10.1007/s40305-023-00456-6 Abstract （172）      PDF       Knowledge map    Save In this paper, we discuss the perturbation analysis of the extended vertical linear complementarity problem (EVLCP). Under the assumption of the row $\mathcal{W}$-property, we derive several absolute and relative perturbation bounds of EVLCP, which extend some existing results. Several numerical examples are given to show the proposed bounds. Reference | Related Articles | Metrics | Comments（0）

Select

The Minimum Centroid Branch Spanning Tree Problem Hao Lin, Cheng He Journal of the Operations Research Society of China    2024, 12 (2): 528-539.   DOI: 10.1007/s40305-022-00419-3 Abstract （112）      PDF       Knowledge map    Save For a spanning tree T of graph G, the centroid of T is a vertex v for which the largest component of T - v has as few vertices as possible. The number of vertices of this component is called the centroid branch weight of T. The minimum centroid branch spanning tree problem is to find a spanning tree T of G such that the centroid branch weight is minimized. In application to design of communication networks, the loads of all branches leading from the switch center should be as balanced as possible. In this paper, we prove that the problem is strongly NP-hard even for bipartite graphs. Moreover, the problem is shown to be polynomially solvable for split graphs, and exact formulae for special graph families, say Kn1,n2,…,nk and Pm×Pn, are presented. Reference | Related Articles | Metrics | Comments（0）

Select

An Enhanced Conic Reformulation for Capacity-Constrained Assortment Optimization Under the Mixture of Multinomial Logit Model Shan Jiang, Ka-Meng Nip Journal of the Operations Research Society of China    2024, 12 (3): 757-771.   DOI: 10.1007/s40305-022-00438-0 Abstract （160）      PDF       Knowledge map    Save In this work, we study the conic quadratic mixed-integer formulation for assortment optimization problem under the mixture of multinomial logit (MMNL) model. The MMNL model generalizes the widely studied multinomial logit choice model and can approximate any random utility model with an arbitrary additive error. An important operational decision problem in revenue management is assortment optimization problem, which aims to find a subset of products to make available to customers that maximizes the expected revenue of the retailer. It is known that assortment optimization problem under the MMNL model is NP-hard and inapproximable within any constant performance guarantee. Commonly used methods for solving such problem are heuristical approaches or customized combinatorial optimization approaches. In the meanwhile, studies related to global optimization approaches are relatively scarce. We propose an enhanced conic quadratic mixed-integer formulation for solving assortment optimization problem under the MMNL model with a higher computational efficiency. Furthermore, we conduct extensive numerical experiments to demonstrate that the proposed reformulation significantly outperforms the existing conic reformulations for assortment optimization under the MMNL model. Reference | Related Articles | Metrics | Comments（0）

Select

An Accelerated Stochastic Mirror Descent Method Bo-Ou Jiang, Ya-Xiang Yuan Journal of the Operations Research Society of China    2024, 12 (3): 549-571.   DOI: 10.1007/s40305-023-00492-2 Abstract （227）      PDF       Knowledge map    Save Driven by large-scale optimization problems arising from machine learning, the development of stochastic optimization methods has witnessed a huge growth. Numerous types of methods have been developed based on vanilla stochastic gradient descent method. However, for most algorithms, convergence rate in stochastic setting cannot simply match that in deterministic setting. Better understanding the gap between deterministic and stochastic optimization is the main goal of this paper. Specifically, we are interested in Nesterov acceleration of gradient-based approaches. In our study, we focus on acceleration of stochastic mirror descent method with implicit regularization property. Assuming that the problem objective is smooth and convex or strongly convex, our analysis prescribes the method parameters which ensure fast convergence of the estimation error and satisfied numerical performance. Reference | Related Articles | Metrics | Comments（0）

Select

The Role of Consumer Privacy Concerns in Shaping Platform Strategy for Online Markets Jin-Kun Yang, Yong-Rui Duan, Jia-Zhen Huo Journal of the Operations Research Society of China    2024, 12 (2): 363-386.   DOI: 10.1007/s40305-022-00396-7 Abstract （82）      PDF       Knowledge map    Save We investigate the effects of consumer privacy concerns on the pricing and personal data collection strategy of an online platform. The online platform derives revenues from disclosing consumer information to firms. Firms compete for the information in order to enable them to price discriminate and thus derive revenues from consumer purchases. A novel aspect of our research is that we allow the online platform to sell only a subset of consumer data. We develop analytical models where consumers can/cannot protect their privacy. Our analysis yields three main conclusions. First, in the monopoly case, we find that when the consumer privacy disclosure aversion cost is relatively low, it is optimal for the platform to sell all consumer information to the firm. Second, in the duopoly case, we illustrate that when the consumer privacy disclosure aversion cost is relatively low, the platform will sell all consumer information to only one firm; when the cost is moderate, the platform will choose to sell the information of only some consumers and to only one firm; when the cost is relatively high, the platform will select only some of the consumers and sell their information to both firms. Third, it will be better for the platform to provide the information protection service for free when the privacy cost is low. Reference | Related Articles | Metrics | Comments（0）

Select

Decision and Coordination in a Closed-Loop Supply Chain with Product Recycling Under Different Low-Carbon Regulations Qian-Dong Dong, Hai-Wen Xu Journal of the Operations Research Society of China    2024, 12 (3): 695-728.   DOI: 10.1007/s40305-022-00429-1 Abstract （144）      PDF       Knowledge map    Save The implementation of recycling activity is of great significance to closed-loop supply chain operations. Consumers’ environmental awareness and governmental subsidy are considered in the two-echelon closed-loop supply chain. Two types of decision-making structures are proposed under different carbon emission regulations. The subsidy sharing mechanism is designed to resolve the channel members’ conflict caused by double marginalization. This paper provides insight into the effect of environmental awareness and government subsidy under different low-carbon regulations on the supply chain benefit and social welfare via the game theory. The analysis results display that the government subsidy and subsidy sharing mechanism are profitably beneficial to the whole supply chain and social welfare. Moreover, a noteworthy result reveals that social welfare is not always directly proportional to consumers’ environmental awareness. Social welfare decreases slightly with the increase in consumers’ environmental awareness when consumers’ environmental awareness is weak. However, social welfare will be significantly improved when consumers’ environmental awareness increases beyond a certain threshold. Reference | Related Articles | Metrics | Comments（0）

Select

Existence of α-Cores for Games Without Compact Assumptions Hai-Qun Zhang Journal of the Operations Research Society of China    2024, 12 (2): 520-527.   DOI: 10.1007/s40305-022-00420-w Abstract （82）      PDF       Knowledge map    Save Following the representation of Kajii (J Econ Theory 56:194–205, 1992), we provide some existence theorems of α-cores for games without ordered preferences and compact assumptions. As applications, we obtain some existence results of the α-core for normal-form games without compact assumptions. Reference | Related Articles | Metrics | Comments（0）

Select

The Multi-visits Drone-Vehicle Routing Problem with Simultaneous Pickup and Delivery Service Si Zhang, Lu Li Journal of the Operations Research Society of China    2024, 12 (4): 965-995.   DOI: 10.1007/s40305-023-00471-7 Abstract （333）      PDF       Knowledge map    Save The development of convergent technology makes the drone expected to become a commercial delivery method for terminal logistics distribution. Although the industry has begun to experiment with the coordinated transportation of drones and vehicles, some limited assumptions have been made to reduce the complexity of synchronization. This paper studies the mathematical formulations and efficient solution methodologies for the multi-visits drone-vehicle routing problem with simultaneous pickup and delivery service (MDVRPSPD), whose objective is to minimize the distance traveled by drones and vehicles and the total number of drones used. To solve the MDVRPSPD problem, a three-stage solution method is designed. Firstly, the scalable K-means++ algorithm is used to determine the vehicle’s parking location, and we optimize the vehicle’s driving route by traveling salesman problem (TSP) modeling; then, the classic tabu search algorithm is extended to arrange the schedule of drones which consider multi-visits and simultaneous pickup and delivery service. Meanwhile, a set of extensive computational experiments are conducted to demonstrate the efficiency of developed heuristics and the superiority of drone-vehicle delivery system on delivery issues. Reference | Related Articles | Metrics | Comments（0）

Select

Directional Derivative and Subgradient of Cone-Convex Set-Valued Mappings with Applications in Set Optimization Problems Yu Han Journal of the Operations Research Society of China    2024, 12 (4): 1103-1125.   DOI: 10.1007/s40305-023-00454-8 Abstract （366）      PDF       Knowledge map    Save In this paper, we introduce a new directional derivative and subgradient of set-valued mappings by using a nonlinear scalarizing function. We obtain some properties of directional derivative and subgradient for cone-convex set-valued mappings. As applications, we present necessary and sufficient optimality conditions for set optimization problems and show that the local weak l-minimal solutions of set optimization problems are the global weak l-minimal solutions of set optimization problems under the assumption that the objective mapping is cone-convex. Reference | Related Articles | Metrics | Comments（0）

Select

Restricted Arc-Connectivity of Harary Digraphs Jun-Hao Zhang, Ji-Xiang Meng Journal of the Operations Research Society of China    2024, 12 (2): 540-547.   DOI: 10.1007/s40305-022-00406-8 Abstract （104）      PDF       Knowledge map    Save The h-restricted arc-connectivity of a digraph is an important parameter to measure fault-tolerance of interconnection networks. This paper determines that the h-restricted arc-connectivity of the Harary digraph D = G(n; 1, 2, …, k) is equal to n/2 for 2≤h≤n/2, k = 2 and n is even, and λh(D) = g(k - 1) for 2≤h≤g and 3≤k <n/2, where g is the girth of D. As consequences, the super restricted arc-connectedness of Harary digraph D is obtained immediately. In particular, for k = 2 and n is even or 3≤k < n/2 and n can be divided by k, it can be determined that distinct positive (respectively, negative) λh-superatoms of D are vertex disjoint for 2≤h≤g. Reference | Related Articles | Metrics | Comments（0）

Select

Cyclic Gradient Methods for Unconstrained Optimization Ya Zhang, Cong Sun Journal of the Operations Research Society of China    2024, 12 (3): 809-828.   DOI: 10.1007/s40305-022-00432-6 Abstract （235）      PDF       Knowledge map    Save Gradient method is popular for solving large-scale problems. In this work, the cyclic gradient methods for quadratic function minimization are extended to general smooth unconstrained optimization problems. Combining with nonmonotonic line search, we prove its global convergence. Furthermore, the proposed algorithms have sublinear convergence rate for general convex functions, and R-linear convergence rate for strongly convex problems. Numerical experiments show that the proposed methods are effective compared to the state of the arts. Reference | Related Articles | Metrics | Comments（0）

Select

Disjoint Cycles and Degree Sum Condition in a Graph Chun-Jiao Song, Yun Wang, Jin Yan Journal of the Operations Research Society of China    2024, 12 (4): 1072-1087.   DOI: 10.1007/s40305-023-00473-5 Abstract （407）      PDF       Knowledge map    Save For an integer t, where t ≥ 2, let σt(G) denote the minimum degree sum of an independent set with t vertices in a graph G. We prove that for two integers k, t with k ≥ 3, t ≥ 4, every graph G with |V(G)| ≥ kt + 1.5k + t and σt(G) ≥ 2kt -t +1 contains k disjoint cycles. This result improves the theorem of Ma and Yan by optimizing the lower bound of |V(G)|. In addition, we also improve the theorem of Gould et al. for t = 4 and k ≥ 2. Reference | Related Articles | Metrics | Comments（0）

Select

Local search yields a PTAS for fixed-dimensional k-means problem with penalties Fan Yuan, Da-Chuan Xu, Dong-Lei Du, Dong-Mei Zhang Journal of the Operations Research Society of China    2024, 12 (2): 351-362.   DOI: 10.1007/s40305-022-00394-9 Abstract （81）      PDF       Knowledge map    Save We study a problem called the k-means problem with penalties (k-MPWP), which is a natural generalization of the typical k-means problem. In this problem, we have a set D of client points in ℝd, a set F of possible centers in ℝd, and a penalty cost pj > 0 for each point j ∈ D. We are also given an integer k which is the size of the center point set. We want to find a center point set S ⊆ F with size k, choose a penalized subset of clients P ⊆ D, and assign every client in D\P to its open center. Our goal is to minimize the sum of the squared distances between every point in D\P to its assigned centre point and the sum of the penalty costs for all clients in P. By using the multi-swap local search technique and under the fixed-dimensional Euclidean space setting, we present a polynomial-time approximation scheme (PTAS) for the k-MPWP. Reference | Related Articles | Metrics | Comments（0）

Select

Convergence, Scalarization and Continuity of Minimal Solutions in Set Optimization Karuna, C. S. Lalitha Journal of the Operations Research Society of China    2024, 12 (3): 773-793.   DOI: 10.1007/s40305-022-00440-6 Abstract （183）      PDF       Knowledge map    Save The paper deals with the study of two different aspects of stability in the given space as well as the image space, where the solution concepts are based on a partial order relation on the family of bounded subsets of a real normed linear space. The first aspect of stability deals with the topological set convergence of families of solution sets of perturbed problems in the image space and Painlevé-Kuratowski set convergence of solution sets of the perturbed problems in the given space. The convergence in the given space is also established in terms of solution sets of scalarized perturbed problems. The second aspect of stability deals with semicontinuity of the solution set maps of parametric perturbed problems in both the spaces. Reference | Related Articles | Metrics | Comments（0）

Select

An Approximation Algorithm Based on Seeding Algorithm for Fuzzy k-Means Problem with Penalties Wen-Zhao Liu, Min Li Journal of the Operations Research Society of China    2024, 12 (2): 387-409.   DOI: 10.1007/s40305-022-00399-4 Abstract （59）      PDF       Knowledge map    Save As a classic NP-hard problem in machine learning and computational geometry, the k-means problem aims to partition the given dataset into k clusters according to the minimal squared Euclidean distance. Different from k-means problem and most of its variants, fuzzy k-means problem belongs to the soft clustering problem, where each given data point has relationship to every center point. Compared to fuzzy k-means problem, fuzzy k-means problem with penalties allows that some data points need not be clustered instead of being paid penalties. In this paper, we propose an O(αk ln k)- approximation algorithm based on seeding algorithm for fuzzy k-means problem with penalties, where α involves the ratio of the maximal penalty value to the minimal one. Furthermore, we implement numerical experiments to show the effectiveness of our algorithm. Reference | Related Articles | Metrics | Comments（0）

Select

An Upper Bound for the Transversal Number of Connected k-Uniform Hypergraphs Zi-An Chen, Bin Chen Journal of the Operations Research Society of China    2024, 12 (3): 829-835.   DOI: 10.1007/s40305-022-00445-1 Abstract （216）      PDF       Knowledge map    Save Let H be a hypergraph with vertex set V(H) and hyperedge set E(H). We call a vertex set R $\subseteq$ V(H) a transversal if it has a nonempty intersection with every hyperedge of H. The transversal number, denoted by τ(H), is the minimum cardinality of transversals. In 2021, Diao verified that the upper bound of transversal number for any connected 3-uniform hypergraph H is at most $\frac{2 m+1}{3}$, that is, τ(H) $\frac{2 m+1}{3}$, where m is the size of H. Moreover, they gave the necessary and sufficient conditions to reach the upper bound, namely τ(H) = $\frac{2 m+1}{3}$, if and only if H is a hypertree with a perfect matching. In this paper, we investigate the transversal number of connected kuniform hypergraphs for k ≥ 3. We confirm that τ(H) $\frac{(k-1) m+1}{k}$ for any k-uniform hypergraph H with size m. Furthermore, we show that τ(H) = $\frac{(k-1) m+1}{k}$ if and only if H is a hypertree with a perfect matching, which generalizes the results of Diao. Reference | Related Articles | Metrics | Comments（0）

Select

Low Rank Tensor Decompositions and Approximations Jiawang Nie, Li Wang, Zequn Zheng Journal of the Operations Research Society of China    2024, 12 (4): 847-873.   DOI: 10.1007/s40305-023-00455-7 Abstract （355）      PDF       Knowledge map    Save There exist linear relations among tensor entries of low rank tensors. These linear relations can be expressed by multi-linear polynomials, which are called generating polynomials. We use generating polynomials to compute tensor rank decompositions and low rank tensor approximations. We prove that this gives a quasi-optimal low rank tensor approximation if the given tensor is sufficiently close to a low rank one. Reference | Related Articles | Metrics | Comments（0）

Select

Turán Numbers of Expanded Intersecting Cliques in 3-graphs Yu-Cong Tang, Tong Li, Gui-Ying Yan Journal of the Operations Research Society of China    2024, 12 (4): 952-964.   DOI: 10.1007/s40305-022-00451-3 Abstract （329）      PDF       Knowledge map    Save Let $\ell$ > r ≥ 3. Given a 2-graph F, the expansion F(r) of F is an r-graph obtained from F by adding r - 2 new vertices into each edge. When F is a clique of order $\ell$, the Turán number ex(n, F(r)) was first asymptotically determined by Mubayi (J Comb Theory Ser B 96:122-134, 2006) and exactly computed by Pikhurko (J Comb Theory Ser B 103:220-225, 2013). Let Fk,$\ell$ be the 2-graph on ($\ell$-1)k + 1 vertices consisting of k cliques of order $\ell$ intersecting at exactly one vertex. We determine the exact Turán number ex(n, Fk,$\ell$(3)) for all $\ell$ > 3, k ≥ 1 and sufficiently large n, as well as the corresponding extremal graphs. Reference | Related Articles | Metrics | Comments（0）

Select

On Fractional (g, f, n’, m)-Critical Covered Graphs Wei Gao, Wei-Fan Wang Journal of the Operations Research Society of China    2024, 12 (2): 446-460.   DOI: 10.1007/s40305-022-00409-5 Abstract （80）      PDF       Knowledge map    Save The main contribution in this article is threefold: (1) we show the necessary and sufficient condition for graphs to be fractional (g, f)-covered which can be expressed in different forms, and extended to fractional (g, f, m)-covered graphs; (2) the concept of fractional (g, f, n’, m)-critical covered graph is put forward and its necessary and sufficient condition is given; (3) we present the degree condition for a graph to be fractional (g, f, n’, m)-critical covered, and show that degree bound is sharp when m is small. Moreover, the related result in fractional (a, b, n’, m)-critical covered setting is also verified. Reference | Related Articles | Metrics | Comments（0）