A matheuristic approach for solving the 2-connected dominating set problem حسب Raka Jovanovic (17947838)

"…<p dir="ltr">This paper describes a matheuristic approach for solving the 2-connected dominating set problem (2-CDS). …"

A GRASP Approach for Solving Large-Scale Electric Bus Scheduling Problems حسب Raka Jovanovic (17947838)

"…The problem is modelled using a mixed integer program (MIP) in which the charging time of an EB is pertinent to the battery’s state-of-charge level. …"

A hybrid of clustering and meta-heuristic algorithms to solve a p-mobile hub location–allocation problem with the depreciation cost of hub facilities حسب Mahdi Mokhtarzadeh (11593310)

"…In this study, a novel p-mobile hub location–allocation problem is developed. Hub facilities can be transferred to other hubs for the next period. …"

Queuing-Based Optimization of EV Charging Stations: A Case Study of Manama City, Bahrain حسب Albinali, Hamad A.Rahman

احصل على النص الكامل

The bus sightseeing problem حسب Qian Hu (205735)

"…Two interconnected decision levels have to be jointly tackled: assignment of tourists to buses and routing of buses to the various attractions. A mixed-integer programming formulation for the BSP is provided and solved by a Benders decomposition algorithm. …"

Autonomous Vehicles Delivery Systems: Analyzing Vehicle Routing Problems with a Moving Depot حسب Madani, Batool Mezar

احصل على النص الكامل

Quarantine-aware home healthcare routing and scheduling: a bi-objective approach حسب Najmeh Nabavizadeh (22928821)

"…For model resolution, we employ the augmented ɛ-constraint (AUGMECON) method and conduct several sensitivity analyses related to workload balancing's impact on other decision variables. To illustrate the problem’s complexity and assess the effectiveness of the proposed MILP model across various scenarios, 15 additional sample instances have been solved and documented in the Appendix. …"

Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets حسب Raka Jovanovic (17947838)

"…Specifically, the learning mechanism of the fixed set search (FSS) metaheuristic is combined with the use of integer programming for solving subproblems. This is achieved by introducing a new ground set of elements that can be used for both the MKP and the KPFS that aim to maximize the information provided by the fixed set. …"

Transformations for Variants of the Travelling Salesman Problem and Applications حسب Assaf, Mustafa Jamil

احصل على النص الكامل

On the periodic hierarchical Chinese postman problem حسب Muhammed Emre Keskin (19457413)

"…<p dir="ltr">This paper presents a mathematical formulation and a heuristic approach for a new variant of the Hierarchical Chinese Postman Problem (HCPP). Indeed, we introduce the concept of periodicity, and we define and solve, for the first time, the Periodic-HCPP, denoted as P-HCPP. …"

Properties of Unique Degree Sequences of 3-Uniform Hypergraphs حسب Tarsissi, Lama

"…A well known result of Erdös and Gallai (1960) shows that the same problem related to graphs can be solved in polynomial time. …"
احصل على النص الكامل

A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM حسب Al-Mohamad, HA

"…The linear program is solved using a Simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. …"
احصل على النص الكامل

Optimization of Energy Consumption in Cloud Computing Datacenters حسب Osman, Ahmed Osman

احصل على النص الكامل

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method حسب Nour ElHouda Tellache (22565366)

"…This paper introduces and investigates two integer programming formulations for this problem. …"

A comparative analysis of MIP formulations for the multi-mode resource-constrained independent task scheduling problem حسب Maryam Al-Khatib (19561909)

"…This problem commonly arises in the context of multiproject scheduling. …"

Logic-based Benders decomposition combined with column generation for mobile 3D printer scheduling problem حسب Tao Li (86810)

"…A mixed-integer linear programming model is proposed to describe this problem. …"

A linear programming approach for the weighted graph matchingproblem حسب Almohamad, H.A.

"…The linear program is solved using a simplex-based algorithm. Then, approximate 0-1 integer solutions are obtained by applying the Hungarian method on the real solutions of the linear program. …"
احصل على النص الكامل
احصل على النص الكامل

UAV-assisted Multi-tier Computing Framework for IoT Networks حسب Tout, Abeer

"…This work aims at optimizing the number and position of deployed UAVs, IoT-to-UAV association, resource allocation, and task offloading to UAVs, edge servers, and the cloud, while ensuring various system constraints. The problem is formulated as a mixed integer programming problem and solved using Successive Convex Approximation. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

Correlation Clustering via s-Club Cluster Edge Deletion حسب Makarem, Norma

"…Finally, we consider the 3-clubs Cluster Edge Deletion which did not have much focus in the literature. The problem can be solved in time O(4k). We present a first fixed-parameter algorithm that breaks this 4k barrier by solving the problem in O(3.65k) time. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل

A Framework for Project Time-Cost Optimization Considering Float Consumption Impact حسب Al Haj, Rana Ali

احصل على النص الكامل