papers

Publications (28)

math.OC2018

Optimal Solution of Vehicle Routing Problems with Fractional Objective Function

Roberto Baldacci, Andrew Lim, Emiliano Traversi +1

This work proposes a first extensive analysis of the Vehicle Routing Problem with Fractional Objective Function (vrpfof). We investigate how the principal techniques used either in…

cs.DS2025

Multi-Queue SSD I/O Modeling & Its Implications for Data Structure Design

Erin Ransom, Andrew Lim, Michael Mitzenmacher

Understanding the performance profiles of storage devices and how best to utilize them has always been non-trivial due to factors such as seek times, caching, scheduling, concurren…

cs.CR2021

Do the Rich Get Richer? Fairness Analysis for Blockchain Incentives

Yuming Huang, Jing Tang, Qianhao Cong +2

Proof-of-Work (PoW) is the most widely adopted incentive model in current blockchain systems, which unfortunately is energy inefficient. Proof-of-Stake (PoS) is then proposed to ta…

cs.DS2021

Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint

Jing Tang, Xueyan Tang, Andrew Lim +3

Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we r…

cs.LG2020

Directed Graph Convolutional Network

Zekun Tong, Yuxuan Liang, Changsheng Sun +2

Graph Convolutional Networks (GCNs) have been widely used due to their outstanding performance in processing graph-structured data. However, the undirected graphs limit their appli…

cs.DS2014

Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost

Zhixin Luo, Hu Qin, Wenbin Zhu +1

This paper addresses a new vehicle routing problem that simultaneously involves time windows, split collection and linear weight-related cost, which is a generalization of the spli…