Results 11 to 20 of about 466,051 (218)
Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
Algorithms, 2021 The problem of efficiently cutting smaller two-dimensional pieces from a larger surface is recurrent in several manufacturing settings. This problem belongs to the domain of cutting and packing (C&P) problems.
Bonfim Amaro Junior +4 more
doaj +1 more source
Dynamic Graph Clustering Using Minimum-Cut Trees
Journal of Graph Algorithms and Applications, 2012 Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering algorithm by Flake et al.
Robert Görke +2 more
doaj +1 more source
Journal of Machine Engineering, 2021 This paper presents a study to ensure the minimum value of Ra and Rz, and the maximum value of MRR when external cylindrical grinding by the PSI. The experiments performed according to the orthogonal Taguchi L9 matrix with the input parameters were ...
Dung Hoang Tien +3 more
doaj +1 more source
Aggregate production planning using integrated fuzzy multi-objective optimization with α-cut analysis [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2021 Aggregate production planning when operating time, costs, customer demand, labor level, and machine capacity are uncertain is studied. This study optimizes the aggregate production plan, yielding the minimum total costs by using an integrated fuzzy ...
Noppasorn Sutthibutr, Navee Chiadamrong
doaj +1 more source
Hypergraph cuts with edge-dependent vertex weights
Applied Network Science, 2022 We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance of vertices within a hyperedge, thus leading to better characterized cut ...
Yu Zhu, Santiago Segarra
doaj +1 more source
Environmental sustainability during machining of hardened steel using nanofluid: A case study [PDF]
E3S Web of Conferences, 2023 The positive effects of nanofluid-assisted minimum quantity lubrication include improved performance during machining and environmental sustainability. In the present study two cutting parameters levels such as feed rate of 0.05 (mm/rev)- depth of cut of
Khatai Saswat +3 more
doaj +1 more source
Nihon Kikai Gakkai ronbunshu, 2023 An experiment was conducted to proove that a single-point cutting tool made of nano-polycrystalline diamond with a cutting edge radius of 0.3 nm can fabricate a cut face without damaged layer by decreasing the depth of cut.
Takuya SEMBA +2 more
doaj +1 more source
Mining Protein Complexes from PPI Networks Using the Minimum Vertex Cut
Tsinghua Science and Technology, 2012 Evidence shows that biological systems are composed of separable functional modules. Identifying protein complexes is essential for understanding the principles of cellular functions. Many methods have been proposed to mine protein complexes from protein-
Xiaojun Ding +3 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2022 A set S ⊆ V (G) is a vertex k-cut in a graph G = (V (G), E(G)) if G − S has at least k connected components. The k-connectivity of G, denoted as κk(G), is the minimum cardinality of a vertex k-cut in G. We give several constructions of a set S such that (
Erker Tjaša Paj, Špacapan Simon
doaj +1 more source
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Communications in Combinatorics and Optimization, 2017 Let $G$ be a connected graph with minimum degree $\delta$ and edge-connectivity $\lambda$. A graph is maximally edge-connected if $\lambda=\delta$, and it is super-edge-connected if every minimum edge-cut is trivial; that is, if every ...
Lutz Volkmann, Zhen-Mu Hong
doaj +1 more source