Chromaticity of Certain Bipartite Graphs by Hasni @ Abdullah, Roslan

Subjects: “…Bipartite graphs…”
Get full text

Chromatically unique bipartite graphs with certain 3-independent partition numbers III by Hasni @ Abdullah, Roslan, Peng, Yee Hock

“…For integers p, q, s with p ≥ q ≥ 2 and s ≥ 0 , let ( ) 2 , K−s p q denote the set of 2_connected bipartite graphs which can be obtained from K(p,q) by deleting a set of s edges. …”
Get full text

Two families of chromatically unique graphs. by Yee, Hock Peng

“…In this paper, We prove that a graph (resp., a bipartite graph) obtained from K2,4 U P3 (s ≥ 3) (resp., K3,3 U P3 (s ≥ 7)) by identifying the end vertices of the path Ps with any two vertices of the complete bipartite graph K2,4 (resp., K3,3) is chromatically unique.…”
Get full text

Markov bases and toric ideals for some contingency tables by Mohammed, Nadia Faiq, Rakhimov, Isamiddin Sattarovich, Shitan, Mahendran

“…Moreover, the connected bipartite graph is also constructed by using elements of Markov basis. …”
Get full text

Solving single machine scheduling problem with maximum lateness using a genetic algorithm by Nazif, Habibeh, Lee, Lai Soon

“…We develop an optimised crossover operator designed by an undirected bipartite graph within a genetic algorithm for solving a single machine family scheduling problem, where jobs are partitioned into families and setup time is required between these families. …”
Get full text

Optimised crossover genetic algorithm for capacitated vehicle routing problem by Nazif, Habibeh, Lee, Lai Soon

“…The proposed algorithm uses an optimised crossover operator designed by a complete undirected bipartite graph to find an optimal set of delivery routes satisfying the requirements and giving minimal total cost. …”
Get full text

A genetic algorithm on single machine family scheduling problem to minimise total weighted completion time by Nazif, Habibeh, Lee, Lai Soon

“…For this problem, we propose a genetic algorithm using an optimised crossover operator designed by an undirected bipartite graph to find an optimal schedule which minimises the total weighted completion time of the jobs in the presence of the sequence independent family setup times. …”
Get full text

Optimized crossover genetic algorithm for vehicle routing problem with time windows by Nazif, Habibeh, Lee, Lai Soon

“…Approach: We proposed a genetic algorithm using an optimized crossover operator designed by a complete undirected bipartite graph that finds an optimal set of delivery routes satisfying the requirements and giving minimal total cost. …”
Get full text

A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

“…During crossover, the OCGA selects two parents from the population and replaces them with two children by an optimized crossover mechanism which designed using an undirected bipartite graph. Various techniques are also introduced to further enhance the solution quality. …”