Hamid Mokhtar

According to our database, Hamid Mokhtar authored at least 12 papers between 2015 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Hybridised ant colony optimisation for convoy movement problem.

Alan J. Maniamkot, P. N. Ram Kumar, Mohan Krishnamoorthy, Hamid Mokhtar, Rajagopalan Sridharan

Ann. Oper. Res., 2022

2021

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes.

R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, T. M. Rajalaxmi

J. Supercomput., 2021

Distance-constrained labellings of Cartesian products of graphs.

Anna Lladó, Hamid Mokhtar, Oriol Serra, Sanming Zhou

Discret. Appl. Math., 2021

2020

Cube-connected circulants: Bisection width, Wiener and forwarding indices.

Hamid Mokhtar

Discret. Appl. Math., 2020

2019

An intermodal hub location problem for container distribution in Indonesia.

Hamid Mokhtar, A. A. N. Perwira Redi, Mohan Krishnamoorthy, Andreas T. Ernst

Comput. Oper. Res., 2019

The 2-allocation <i>p</i>-hub median problem and a modified Benders decomposition method for solving hub location problems.

Hamid Mokhtar, Mohan Krishnamoorthy, Andreas T. Ernst

Comput. Oper. Res., 2019

2017

Cube-Connected Circulants as Efficient Models for Interconnection Networks.

Hamid Mokhtar

J. Interconnect. Networks, 2017

Recursive cubes of rings as models for interconnection networks.

Hamid Mokhtar, Sanming Zhou

Discret. Appl. Math., 2017

A Modified Benders Method for the Single- and Multiple Allocation <i>P</i>-Hub Median Problems.

Hamid Mokhtar, Mohan Krishnamoorthy, Andreas T. Ernst

Proceedings of the Operations Research Proceedings 2017, 2017

2016

A few families of Cayley graphs and their efficiency as communication networks.

Hamid Mokhtar

PhD thesis, 2016

2015

Forwarding and optical indices of 4-regular circulant networks.

Heng-Soon Gan, Hamid Mokhtar, Sanming Zhou

J. Discrete Algorithms, 2015

Recursive cube of rings.

Hamid Mokhtar, Sanming Zhou

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015