Zobrazeno 1 - 10
of 212
pro vyhledávání: '"Zhao, Jingyang"'
The Traveling Tournament Problem (TTP) is a well-known benchmark problem in the field of tournament timetabling, which asks us to design a double round-robin schedule such that each pair of teams plays one game in each other's home venue, minimizing
Externí odkaz:
http://arxiv.org/abs/2404.10955
Autor:
Zhao, Jingyang, Xiao, Mingyu
Given an edge-weighted metric complete graph with $n$ vertices, the maximum weight metric triangle packing problem is to find a set of $n/3$ vertex-disjoint triangles with the total weight of all triangles in the packing maximized. Several simple met
Externí odkaz:
http://arxiv.org/abs/2402.08216
Autor:
Zhao, Jingyang, Xiao, Mingyu
Given an edge-weighted (metric/general) complete graph with $n$ vertices, the maximum weight (metric/general) $k$-cycle/path packing problem is to find a set of $\frac{n}{k}$ vertex-disjoint $k$-cycles/paths such that the total weight is maximized. I
Externí odkaz:
http://arxiv.org/abs/2311.11332
Autor:
Zhao, Jingyang, Xiao, Mingyu
The Traveling Tournament Problem (TTP-$k$) is a well-known benchmark problem in tournament timetabling, which asks us to design a double round-robin schedule such that the total traveling distance of all $n$ teams is minimized under the constraints t
Externí odkaz:
http://arxiv.org/abs/2309.01902
Autor:
Zhao, Jingyang, Xiao, Mingyu
The Multidepot Capacitated Vehicle Routing Problem (MCVRP) is a well-known variant of the classic Capacitated Vehicle Routing Problem (CVRP), where we need to route capacitated vehicles located in multiple depots to serve customers' demand such that
Externí odkaz:
http://arxiv.org/abs/2308.14131
Autor:
Zhao, Jingyang, Xiao, Mingyu
The Traveling Tournament Problem (TTP-$k$) is a well-known benchmark problem in sports scheduling, which asks us to design a double round-robin schedule such that each pair of teams plays one game in each other's home venue, each team plays at most $
Externí odkaz:
http://arxiv.org/abs/2308.14124
Autor:
Shen, Bo, Zhang, Jiaxin, Chen, Taihong, Zan, Daoguang, Geng, Bing, Fu, An, Zeng, Muhan, Yu, Ailun, Ji, Jichuan, Zhao, Jingyang, Guo, Yuenan, Wang, Qianxiang
Large Language Models for Code (Code LLM) are flourishing. New and powerful models are released on a weekly basis, demonstrating remarkable performance on the code generation task. Various approaches have been proposed to boost the code generation pe
Externí odkaz:
http://arxiv.org/abs/2307.14936
Autor:
Zhao, Jingyang, Xiao, Mingyu
The Traveling Tournament Problem (TTP) is a hard but interesting sports scheduling problem inspired by Major League Baseball, which is to design a double round-robin schedule such that each pair of teams plays one game in each other's home venue, min
Externí odkaz:
http://arxiv.org/abs/2212.12240
Autor:
Zhao, Jingyang, Xiao, Mingyu
The Capacitated Vehicle Routing Problem (CVRP) is one of the most extensively studied problems in combinatorial optimization. According to the property of the demand of customers, we distinguish three variants of CVRP: unit-demand, splittable and uns
Externí odkaz:
http://arxiv.org/abs/2210.16534
Autor:
Zhao, Jingyang, Xiao, Mingyu
Publikováno v:
In Theoretical Computer Science 27 September 2024 1010