supported by the National Natural Science Foundation of China(Nos.11971349,12071442,12371320,and 12371318).
Capacitated facility location problem(CFLP)is a classical combinatorial optimization problem that has various applications in operations research,theoretical computer science,and management science.In the CFLP,we have...
the National Natural Science Foundation of China(No.11971146);the Natural Science Foundation of Hebei Province of China(Nos.A2019205089 and A2019205092);Hebei Province Foundation for Returnees(No.CL201714);the Graduate Innovation Grant Program of Hebei Normal University(No.CXZZSS2022053).
In this paper,we consider the parallel-machine customer order scheduling with delivery time and submodular rejection penalties.In this problem,we are given m dedicated machines in parallel and n customer orders.Each o...
the National Natural Science Foundation of China(No.12131003);Beijing Natural Science Foundation Project(No.Z200002);the Natural Sciences and Engineering Research Council of Canada(No.06446);the National Natural Science Foundation of China(Nos.11771386 and 11728104);the National Natural Science Foundation of China(No.11871081)。
We study a problem called the k-means problem with penalties(k-MPWP),which is a natural generalization of the typical k-means problem.In this problem,we have a set D of client points in R^(d),a set F of possible cente...
Higher Educational Science and Technology Program of Shandong Province(No.J17KA171);Natural Science Foundation of Shandong Province(No.ZR2020MA029).
As a classic NP-hard problem in machine learning and computational geometry,the k-means problem aims to partition the given dataset into k clusters according to the minimal squared Euclidean distance.Different from k-...
The support vector machine(SVM)is a classical machine learning method.Both the hinge loss and least absolute shrinkage and selection operator(LASSO)penalty are usually used in traditional SVMs.However,the hinge loss i...
This work was supported by the Science and Technology Project of Hebei Education Department(No.BJK2023076);the National Natural Science Foundation of China(Nos.12101594,12001025,and 12131003);the Natural Science Foundation of Shandong Province of China(No.ZR2020MA029).
Min-max disagreements are an important generalization of the correlation clustering problem(CorCP).It can be defined as follows.Given a marked complete graph G=(V,E),each edge in the graph is marked by a positive labe...
The work was supported in part by the National Natural Science Foundation of China(Grant No.12071417)。
In this paper,we consider the-prize-collecting minimum vertex cover problem with submodular penalties,which generalizes the well-known minimum vertex cover problem,minimum partial vertex cover problem and minimum vert...
funded by the National Natural Science Foundation of China(31971986 and 32260478);the Education Technology Innovation Project of Gansu Province(2022QB-076);the Gansu Province Science and Technology Program(20JR10RA520);the Biological Breeding program of Gansu Academy of Agricultural Sciences(2022GAAS04);the Tianshan talent plan of Xinjiang Autonomous Region(2021)。
Flowering time(FTi)is a major factor determining how quickly cotton plants reach maturity.Early maturity greatly affects lint yield and fiber quality and is crucial for mechanical harvesting of cotton in northwestern ...
Financial performance is an indicator to measure the strength of a company’s business operation capability,which is of great concern to enterprise managers,external investors,and government regulators.Based on the da...
This research was supported by the National Natural Science Foundation of China(Nos.11901544 and 11801251).
In the k-level facility location problem with penalties,each client will be either serviced or rejected completely.And if the client is planned to be serviced,then it must be connected to a sequence of k different kin...