Approximation Randomized Strategy-Proof Mechanisms in Obnoxious Facility Game with Weighted AgentsJournal of the Operations Research Society of China - Tập 4 - Trang 357-370 - 2016
Lan Xiao, Xiao-Zhi Zhang
In this paper, we investigate the obnoxious facility location game with weighted
agents. First, we design a randomized group strategy-proof mechanism with
approximation ratio $$\frac{3W_\mathrm{max}}{2W_\mathrm{min}}$$ when the
weighted agents are located on a line; then, on the cycle metric, we also
discuss the strategy-proofness and the approximation ratios of a class of group
strategy-proof det... hiện toàn bộ
Thuật toán Tỉ lệ Affine cho Lập trình Tuyến tính Hai mục tiêu Dịch bởi AI Journal of the Operations Research Society of China - - Trang 1-15 - 2023
Marco Antonio Figueiredo Menezes, Nelson Maculan
Đối với bài toán lập trình tuyến tính hai mục tiêu, chúng tôi phát triển một
thuật toán tỉ lệ affine với hướng tối thiểu-tối đa và chứng minh tính hội tụ của
nó để tìm ra giải pháp hiệu quả. Chúng tôi triển khai thuật toán này cho một số
vấn đề nhỏ trong tài liệu.
#lập trình tuyến tính #thuật toán tỉ lệ affine #hai mục tiêu #tính hội tụ
Herscovici’s Conjecture on the Product of the Thorn Graphs of the Complete GraphsJournal of the Operations Research Society of China - Tập 2 - Trang 263-269 - 2014
Dong-Lin Hao, Ze-Tu Gao, Jian-Hua Yin
Given a distribution of pebbles on the vertices of a connected graph $$G$$ , a
pebbling move on $$G$$ consists of taking two pebbles off one vertex and placing
one on an adjacent vertex. The $$t$$ -pebbling number $$f_t(G)$$ of a simple
connected graph $$G$$ is the smallest positive integer such that for every
distribution of $$f_t(G)$$ pebbles on the vertices of $$G$$ , we can move $$t$$
pebbles ... hiện toàn bộ
Theory of Compressive Sensing via ℓ 1-Minimization: a Non-RIP Analysis and ExtensionsJournal of the Operations Research Society of China - Tập 1 - Trang 79-105 - 2013
Yin Zhang
Compressive sensing (CS) is an emerging methodology in computational signal
processing that has recently attracted intensive research activities. At
present, the basic CS theory includes recoverability and stability: the former
quantifies the central fact that a sparse signal of length n can be exactly
recovered from far fewer than n measurements via ℓ 1-minimization or other
recovery techniques, ... hiện toàn bộ
A Sequential Regression Model for Big Data with Attributive Explanatory VariablesJournal of the Operations Research Society of China - Tập 3 - Trang 475-488 - 2015
Qing-Ting Zhang, Yuan Liu, Wen Zhou, Zhou-Wang Yang
As the applications for modeling of big data and analysis advance in scope,
computational efficiency faces greater challenges in terms of storage and speed.
In many practical problems, a great amount of historical data is sequentially
collected and used for online statistical modeling. For modeling sequential
data, we propose a sequential linear regression method that extracts essential
informatio... hiện toàn bộ
Optimization and Operations Research in Mitigation of a PandemicJournal of the Operations Research Society of China - Tập 10 Số 2 - Trang 289-304 - 2022
Chen, Cai-Hua, Du, Yu-Hang, Ge, Dong-Dong, Lei, Lin, Ye, Yin-Yu
The pandemic of COVID-19 initiated in 2019 and spread all over the world in 2020
has caused significant damages to the human society, making troubles to all
aspects of our daily life. Facing the serious outbreak of the virus, we consider
possible solutions from the perspectives of both governments and enterprises.
Particularly, this paper discusses several applications of supply chain
management, ... hiện toàn bộ
Phase Retrieval via Sensor Network LocalizationJournal of the Operations Research Society of China - Tập 7 - Trang 127-146 - 2018
Sherry Xue-Ying Ni, Man-Chung Yue, Kam-Fung Cheung, Anthony Man-Cho So
The problem of phase retrieval is revisited and studied from a fresh
perspective. In particular, we establish a connection between the phase
retrieval problem and the sensor network localization problem, which allows us
to utilize the vast theoretical and algorithmic literature on the latter to
tackle the former. Leveraging this connection, we develop a two-stage algorithm
for phase retrieval that... hiện toàn bộ
Core of the Reinsurance Market with Dependent RisksJournal of the Operations Research Society of China - Tập 6 - Trang 49-57 - 2017
Jia-Hua Zhang, Shu-Cherng Fang, Yi-Fan Xu
Baton and Lemaire (Astin Bull 12:57–71, 1981) proved the nonemptiness of the
core of a reinsurance market in which the risks of companies are independent.
However, cases involving dependent risks have received increasing concerns in
modern actuarial science. In this paper, we investigate the nonemptiness of the
core of a reinsurance market where the risks of different companies may be
dependent. W... hiện toàn bộ