6篇
您的检索式：作者名="SHAN Erfang"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Lower bounds on dominating functions in graphs显示文摘 | Shan Erfang | 2000 | Ars Combinatorics2000，56，： | 1 |
| 2 | Lower bounds on minus domination and k-subdomination numbers显示文摘 | Liying Kang Hong Qiao Erfang Shan | 2003 | Theoretical Computer Science2003，296，： | 1 |
| 3 | Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties显示文摘This paper studies the batch sizing scheduling problem with earliness and tardiness penalties which is closely related to a two-level supply chain problem.In the problem,there are K customer orders,where each customer order consisting of some unit length jobs has a due date.The jobs are processed in a common machine and then delivered to their customers in batches,where the size of each batch has upper and lower bounds and each batch may incur a fixed setup cost which can also be considered a fixed delivery cost.The goal is to find a schedule which minimizes the sum of the earliness and tardiness costs and the setup costs incurred by creating a new batch.The authors first present some structural properties of the optimal schedules for single-order problem with an additional assumption(a):The jobs are consecutively processed from time zero.Based on these properties,the authors give a polynomial-time algorithm for single-order problem with Assumption(a).Then the authors give dynamic programming algorithms for some special cases of multiple-order problem with Assumption(a).At last,the authors present some structural properties of the optimal schedules for single-order problem without Assumption(a) and give a polynomial-time algorithm for it. | WEI Qi KANG Liying SHAN Erfang | 2016 | Journal of Systems Science & Complexity2016，29，2： | 1 |
| 4 | )istance domination of generalized te Bruijn and Kautz digraphs显示文摘 | Yanxia DONG Erfang SHAN Xiao MIN | 2017 | Frontiers of Mathematics in China2017，12，2： | 1 |
| 5 | The Ferry Cover Problem on Regular Graphs and Small-Degree GraphsThe Ferry Cover Problem on Regular Graphs and Small-Degree Graphs显示文摘The ferry problem may be viewed as generalizations of the classical wolf-goatcabbage puzzle. The ferry cover problem is to determine the minimum required boat capacity to safely transport n items represented by a conflict graph. The Alcuin number of a conflict graph is the smallest capacity of a boat for which the graph possesses a feasible ferry schedule. In this paper the authors determine the Alcuin number of regular graphs and graphs with maximum degree at most five. | Erfang SHAN Liying KANG | 2018 | Chinese Annals of Mathematics,Series B2018，39，6： | 0 |
| 6 | Turán Problems for Berge-(k,p)-Fan Hypergraph显示文摘Let F be a graph.A hypergraph H is Berge-F if there is a bijection f:E(F)→E(H)such that e■f(e)for every e∈E(F).A hypergraph is Berge-F-free if it does not contain a subhypergraph isomorphic to a Berge-F hypergraph.The authors denote the maximum number of hyperedges in an n-vertex r-uniform Berge-F-free hypergraph by ex_(r)(n,Berge-F).A(k,p)-fan,denoted by F_(k,p),is a graph on k(p-1)+1 vertices consisting of k cliques with p vertices that intersect in exactly one common vertex.In this paper they determine the bounds of ex_(r)(n,Berge-F)when F is a(k,p)-fan for k≥2,p≥3 and r≥3. | Zhenyu NI Liying KANG Erfang SHAN | 2021 | Chinese Annals of Mathematics,Series B2021，42，4： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员