Skip to main content

previous disabled Page of 2
and
  1. No Access

    Article

    Online learning under one sided \(\sigma \) -smooth function

    The online optimization model was first introduced in the research of machine learning problems (Zinkevich, Proceedings of ICML, 928–936, 2003). It is a powerful framework that combines the principles of optim...

    Hongxiang Zhang, Dachuan Xu, Ling Gai in Journal of Combinatorial Optimization (2024)

  2. No Access

    Article

    Discrete facility location games with different preferences

    We study the mechanism design for discrete facility location games with different preferences, where the facilities can only be built at a finite set of candidate locations, and a mechanism maps the agent loca...

    Ling Gai, Mengpei Liang, Chenhao Wang in Journal of Combinatorial Optimization (2023)

  3. No Access

    Article

    Green supplier selection and order allocation using linguistic Z-numbers MULTIMOORA method and bi-objective non-linear programming

    Supplier selection and order allocation are major tasks to companies in green supply chain management. Most literatures consider these two tasks as independent sub-problems. In this paper, we propose an integr...

    Ling Gai, Hu-chen Liu, Yanjun Wang, Fuzzy Optimization and Decision Making (2023)

  4. No Access

    Article

    The spherical k-means++ algorithm via local search scheme

    The spherical k-means problem (SKMP) is an important variant of the k-means clustering problem (KMP). In this paper, we consider the SKMP, which aims to divide the n points in a given data point set ...

    **aoyun Tian, Dachuan Xu, Donglei Du, Ling Gai in Journal of Combinatorial Optimization (2022)

  5. Article

    An integrated method for hybrid distribution with estimation of demand matching degree

    Timely and effective distribution of relief materials is one of the most important aspects when fighting with a natural or a man-made disaster. Due to the sudden and urgent nature of most disasters, it is hard...

    Ling Gai, Ying **, Binyuan Zhang in Journal of Combinatorial Optimization (2022)

  6. No Access

    Article

    Selfish bin packing under Harmonic mean cost sharing mechanism

    In this paper, we introduce the selfish bin packing problem under a new version of cost sharing mechanism based on harmonic mean. The items (as agents) are selfish and intelligent to minimize the cost they hav...

    Ling Gai, Chenchen Wu, Dachuan Xu, Weiwei Zhang in Optimization Letters (2022)

  7. No Access

    Article

    Maternal embryonic leucine zipper kinase serves as a potential prognostic marker and leads to sorafenib chemoresistance modified by miR-142-5p in hepatocellular carcinoma

    Chemotherapy is an important treatment strategy for advanced hepatocellular carcinoma (HCC). Sorafenib is a first-line systemic drug that has been commonly used clinically for patients with advanced HCC. Howev...

    Hualei Li, Ling Gai, Zhimei Wu, Feng Li in Molecular Biology Reports (2022)

  8. No Access

    Chapter and Conference Paper

    Online One-Sided Smooth Function Maximization

    In this paper, we consider the problem of online one-sided smooth (OSS for short) function maximization. The concept of OSS was first proposed by Mehrdad et al. [1] to express the properties of multilinear extens...

    Hongxiang Zhang, Dachuan Xu, Ling Gai, Zhenning Zhang in Computing and Combinatorics (2022)

  9. No Access

    Chapter and Conference Paper

    Obnoxious Facility Location Games with Candidate Locations

    We study obnoxious facility location games with facility candidate locations. For obnoxious single facility location games under social utility objective, we present a group strategy-proof mechanism with appro...

    Ling Gai, Mengpei Liang, Chenhao Wang in Algorithmic Aspects in Information and Management (2022)

  10. No Access

    Chapter and Conference Paper

    Two-Facility Location Games with Distance Requirement

    We consider the game of locating two homogeneous facilities in the interval [0, 1] with maximum distance requirement. In this game, n agents report their preferred locations, then the designed mechanism outputs t...

    Ling Gai, Dandan Qian, Chenchen Wu in Frontiers of Algorithmic Wisdom (2022)

  11. No Access

    Article

    Emergency medical center location problem with people evacuation solved by extended TODIM and objective programming

    This study aims to decide the location of emergency medical centers and the evacuation of survivors after a disaster happened. An extended interactive multi-criteria decision making method (TODIM) with interva...

    Ling Gai, Zhiyue Peng, Jiming Zhang, Jiafu Zhang in Journal of Combinatorial Optimization (2021)

  12. No Access

    Chapter and Conference Paper

    On Various Open-End Bin Packing Game

    In this paper, we introduce various open-end bin packing problems in a game theoretic setting. The items (as agents) are selfish and intelligent to minimize the cost they have to pay, by selecting a proper bin...

    Ling Gai, Weiwei Zhang, Wenchang Luo in Combinatorial Optimization and Applications (2021)

  13. No Access

    Chapter and Conference Paper

    A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions

    Nowadays, massive amounts of data are growing at a rapid rate every moment. If data can be processed and analyzed promptly as they arrive, they can bring huge added values to the society. In this paper, we con...

    Min Cui, Donglei Du, Ling Gai, Ruiqi Yang in Combinatorial Optimization and Applications (2021)

  14. No Access

    Chapter and Conference Paper

    The Spherical k-means++ Algorithm via Local Search

    We consider the spherical k-means problem (SKMP), a generalization of the k-means clustering problem (KMP). Given a data set of n points $${\m...

    **aoyun Tian, Dachuan Xu, Donglei Du in Algorithmic Aspects in Information and Man… (2020)

  15. No Access

    Chapter and Conference Paper

    Selfish Bin Packing with Parameterized Punishment

    In this paper we consider the problem of selfish bin packing with parameterized punishment. Different from the classical bin packing problem, each item to be packed belongs to a selfish agent, who wants to max...

    Weiwei Zhang, Alin Gao, Ling Gai in Algorithmic Aspects in Information and Management (2020)

  16. No Access

    Chapter and Conference Paper

    Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs

    In this paper, we consider the balanced 2-correlation clustering problem on well-proportional graphs, which has applications in protein interaction networks, cross-lingual link detection, communication network...

    Sai Ji, Dachuan Xu, Donglei Du, Ling Gai in Algorithmic Aspects in Information and Man… (2020)

  17. No Access

    Chapter and Conference Paper

    Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree

    Timely and effective distribution of relief materials is one of the most important aspects when fighting with a natural or a man-made disaster. Due to the sudden and urgent nature of most disasters, it is hard...

    Ling Gai, Ying **, Binyuan Zhang in Algorithmic Aspects in Information and Management (2020)

  18. No Access

    Article

    An integrated method to solve the healthcare facility layout problem under area constraints

    In this paper, the healthcare facility layout problem with area constraints is considered, a proper departments arrangement is selected such that the operating cost and system efficiency are guaranteed. We pro...

    Ling Gai, Jiandong Ji in Journal of Combinatorial Optimization (2019)

  19. No Access

    Article

    Blocking Rumor by Cut

    In this paper, a rumor blocking problem is studied with an objective function which is neither submodular or supermodular. We will prove that this problem is NP-hard and give a data-dependent approximation wit...

    Ling Gai, Hongwei Du, Lidong Wu, Junlei Zhu in Journal of Combinatorial Optimization (2018)

  20. No Access

    Article

    Minimum choosability of planar graphs

    The problem of list coloring of graphs appears in practical problems concerning channel or frequency assignment. In this paper, we study the minimum number of choosability of planar graphs. A graph G is edge-k-ch...

    Huijuan Wang, Bin Liu, Ling Gai, Hongwei Du in Journal of Combinatorial Optimization (2018)

previous disabled Page of 2