Zobrazeno 1 - 10
of 2 498
pro vyhledávání: '"Cheng, T. C."'
A matching covered graph $G$ is minimal if for each edge $e$ of $G$, $G-e$ is not matching covered. An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also matching covered. Thus a matching covered graph is minimal if and only if it
Externí odkaz:
http://arxiv.org/abs/2405.17040
Consider a complete balanced bipartite graph $K_{n,n}$ and let $K^c_{n,n}$ be an edge-colored version of $K_{n,n}$ that is obtained from $K_{n,n}$ by having each edge assigned a certain color. A subgraph $H$ of $K^c_{n,n}$ is called properly colored
Externí odkaz:
http://arxiv.org/abs/2310.04962
For any integer $k\geq1,$ a graph $G$ has a $k$-factor if it contains a $k$-regular spanning subgraph. In this paper we prove a sufficient condition in terms of the number of $r$-cliques to guarantee the existence of a $k$-factor in a graph with mini
Externí odkaz:
http://arxiv.org/abs/2308.13874
Publikováno v:
International Journal of Production Research; Sep2024, Vol. 62 Issue 18, p6688-6712, 25p
Publikováno v:
International Journal of Production Research; Aug2024, Vol. 62 Issue 16, p6016-6027, 12p
We consider the problem of allocating orders to multiple stations and sequencing the interlinked order and rack processing flows in each station in the robot-assisted KIVA warehouse. The various decisions involved in the problem, which are closely as
Externí odkaz:
http://arxiv.org/abs/2108.09056
Autor:
Azadi, Majid1 (AUTHOR), Cheng, T. C. E.2 (AUTHOR), Matin, Reza Kazemi3 (AUTHOR), Saen, Reza Farzipoor4 (AUTHOR) farzipour@yahoo.com
Publikováno v:
Annals of Operations Research. Apr2024, Vol. 335 Issue 1, p535-562. 28p.
Autor:
Edwin Cheng, T. C.1 (AUTHOR), Kamble, Sachin S.2 (AUTHOR) sachin.kamble@edhec.edu, Belhadi, Amine3 (AUTHOR), Ndubisi, Nelson Oly4 (AUTHOR), Lai, Kee-hung5 (AUTHOR), Kharat, Manoj Govind6 (AUTHOR)
Publikováno v:
International Journal of Production Research. Nov2022, Vol. 60 Issue 22, p6908-6922. 15p. 2 Diagrams, 6 Charts.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.