A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all...
44 KB (5,460 words) - 15:05, 21 June 2025
Capacitated minimum spanning tree is a minimal cost spanning tree of a graph that has a designated root node r {\displaystyle r} and satisfies the capacity...
8 KB (1,276 words) - 16:40, 21 January 2025
containing spanning tree Minimum spanning tree Capacitated minimum spanning tree Distributed minimum spanning tree Euclidean minimum spanning tree k-minimum spanning...
857 bytes (143 words) - 21:24, 30 May 2025
matching: SP1 Bandwidth problem: GT40 Bipartite dimension: GT18 Capacitated minimum spanning tree: ND5 Route inspection problem (also called Chinese postman...
29 KB (2,746 words) - 00:31, 24 April 2025
verification canonical complexity class capacitated facility location capacity capacity constraint Cartesian tree cascade merge sort caverphone Cayley–Purser...
35 KB (3,135 words) - 18:46, 6 May 2025
applied to many problems such as crew scheduling, vehicle routing, and the capacitated p-median problem. The algorithm considers two problems: the master problem...
8 KB (1,360 words) - 06:43, 28 August 2024
dependent setup/changeover times Assembly sequence planning (ASP) problems Capacitated vehicle routing problem (CVRP) Multi-depot vehicle routing problem (MDVRP)...
77 KB (9,484 words) - 10:31, 27 May 2025
Rama 6 Road, Bangkok 10400, Thailand. Sermwatanakul, Amonrat (2019). "Capacitating the local farmers to enhance global marketing of Thailand's national...
80 KB (9,800 words) - 23:50, 6 July 2025