-
作者：Duchenne, Eric; Laporte, Gilbert; Semet, Frederic
作者单位：Centre National de la Recherche Scientifique (CNRS); Universite Polytechnique Hauts-de-France; Universite de Montreal; HEC Montreal
摘要：In the m-peripatetic salesman problem (m-PSP), the aim is to determine m edge disjoint Hamiltonian cycles of minimum total cost on a graph. This article introduces new valid inequalities and polyhedral results for the m-PSP. An improved 2-index branch-and-cut algorithm is developed. Tests performed on randomly generated and TSPLIB Euclidean instances indicate that this algorithm can solve instances with more than double the size of what was previously achievable.
-
作者：Wang, Jiarnin
作者单位：Long Island University; Long Island University Post; Southwest Jiaotong University
摘要：This study extends the classical network median problem by considering the stochastic nature of demand. Assuming that the demand weights associated with nodes are independent discrete random variables, we introduce a chance-constrained programming model to define a beta-reliable median of the network. It is shown that the P-reliable median problem is NP-hard. Exact solution procedures and a normal approximation algorithm are developed to search for the beta-reliable median. Their performance i...
-
作者：Zhuang, Jun; Bier, Vicki M.
作者单位：University of Wisconsin System; University of Wisconsin Madison
摘要：In this paper, we apply game theory to identify equilibrium strategies for both attacker and defender in a fully endogenous model of resource allocation for countering terrorism and natural disasters. The key features of our model include balancing protection from terrorism and natural disasters, and describing the attacker choice by a continuous level of effort rather than a discrete choice (i.e., attack or not). Interestingly, in a sequential game, increased defensive investment can lead an ...
-
作者：Viswanathan, S.
作者单位：Nanyang Technological University
摘要：We develop an algorithm for determining the highest among the class of lower bounds proposed by Atkins and Iyogun (1988) for the joint replenishment problem (JRP) with stochastic demands. The proposed algorithm is simple and does not require many more calculations than an existing lower bound based on equalization of expected runout times.
