|
|
|
|
|
Fakhar Uddin, Naveed Riaz, Abdul Manan, Imran Mahmood, Oh-Young Song, Arif Jamal Malik and Aaqif Afzaal Abbasi
The travelling salesman problem (TSP) is perhaps the most researched problem in the field of Computer Science and Operations. It is a known NP-hard problem and has significant practical applications in a variety of areas, such as logistics, planning, and...
ver más
|
|
|
|
|
|
|
|
|
|
|
Gauri Vaidya, Meghana Kshirsagar and Conor Ryan
Neural networks have revolutionised the way we approach problem solving across multiple domains; however, their effective design and efficient use of computational resources is still a challenging task. One of the most important factors influencing this ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Pejman Goudarzi, Mehdi Hosseinpour, Roham Goudarzi and Jaime Lloret
Cloud computing leads to efficient resource allocation for network users. In order to achieve efficient allocation, many research activities have been conducted so far. Some researchers focus on classical optimisation theory techniques (such as multi-obj...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shornalatha Euttamarajah, Yin Hoe Ng and Chee Keong Tan
With the rapid proliferation of wireless traffic and the surge of various data-intensive applications, the energy consumption of wireless networks has tremendously increased in the last decade, which not only leads to more CO2 emission, but also results ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kaan Yilmaz and Neil Yorke-Smith
In line with the growing trend of using machine learning to help solve combinatorial optimisation problems, one promising idea is to improve node selection within a mixed integer programming (MIP) branch-and-bound tree by using a learned policy. Previous...
ver más
|
|
|
|
|
|
|
|
|
|
|
Ibrahim Ismael Hamad,Mohammad S. Hasan
Pág. pp. 145 - 156
Abstract-The path planning for Multi Mobile Robotic (MMR) system is a recent combinatorial optimisation problem. In the last decade, many researches have been published to solve this problem. Most of these researches focused on metaheuristic algorithms. ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dhananjay Thiruvady, Christian Blum and Andreas T. Ernst
Matheuristics have been gaining in popularity for solving combinatorial optimisation problems in recent years. This new class of hybrid method combines elements of both mathematical programming for intensification and metaheuristic searches for diversifi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Borislav Slavchev, Evelina Masliankova and Steven Kelk
We present an algorithm selection framework based on machine learning for the exact computation of treewidth, an intensively studied graph parameter that is NP-hard to compute. Specifically, we analyse the comparative performance of three state-of-the-ar...
ver más
|
|
|
|
|
|
|
|
|
|
|
Masiala Mavungu,Evan Hurwitz,Tshilidzi Marwala
AbstractOrientation: This article is related to Finances and Optimisation. The auctioneer designs every auction mechanism such that utility is maximised and cost is minimised.Research purpose: This article proposes an optimal auction mechanism through wh...
ver más
|
|
|
|
|
|