-
1
A matheuristic approach for solving the 2-connected dominating set problem
Published 2019“…<p dir="ltr">This paper describes a matheuristic approach for solving the 2-connected dominating set problem (2-CDS). …”
-
2
A GRASP Approach for Solving Large-Scale Electric Bus Scheduling Problems
Published 2021“…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. …”
-
3
A hybrid of clustering and meta-heuristic algorithms to solve a p-mobile hub location–allocation problem with the depreciation cost of hub facilities
Published 2021“…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. …”
-
4
Queuing-Based Optimization of EV Charging Stations: A Case Study of Manama City, Bahrain
Published 2025Get full text
doctoralThesis -
5
The bus sightseeing problem
Published 2023“…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. …”
-
6
Autonomous Vehicles Delivery Systems: Analyzing Vehicle Routing Problems with a Moving Depot
Published 2019Get full text
doctoralThesis -
7
Quarantine-aware home healthcare routing and scheduling: a bi-objective approach
Published 2025“…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. …”
-
8
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
Published 2024“…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. …”
-
9
Transformations for Variants of the Travelling Salesman Problem and Applications
Published 2017Get full text
doctoralThesis -
10
On the periodic hierarchical Chinese postman problem
Published 2021“…<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. …”
-
11
Properties of Unique Degree Sequences of 3-Uniform Hypergraphs
Published 2021“…A well known result of Erdös and Gallai (1960) shows that the same problem related to graphs can be solved in polynomial time. …”
Get full text
-
12
A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM
Published 2020“…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. …”
Get full text
article -
13
Optimization of Energy Consumption in Cloud Computing Datacenters
Published 2018Get full text
doctoralThesis -
14
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
Published 2025“…This paper introduces and investigates two integer programming formulations for this problem. …”
-
15
A comparative analysis of MIP formulations for the multi-mode resource-constrained independent task scheduling problem
Published 2025“…This problem commonly arises in the context of multiproject scheduling. …”
-
16
Logic-based Benders decomposition combined with column generation for mobile 3D printer scheduling problem
Published 2025“…A mixed-integer linear programming model is proposed to describe this problem. …”
-
17
A linear programming approach for the weighted graph matchingproblem
Published 1993“…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. …”
Get full text
Get full text
article -
18
UAV-assisted Multi-tier Computing Framework for IoT Networks
Published 2022“…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. …”
Get full text
Get full text
Get full text
Get full text
masterThesis -
19
Correlation Clustering via s-Club Cluster Edge Deletion
Published 2023“…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. …”
Get full text
Get full text
Get full text
masterThesis -
20
A Framework for Project Time-Cost Optimization Considering Float Consumption Impact
Published 2012Get full text
doctoralThesis
