-
1
A matheuristic approach for solving the 2-connected dominating set problem
منشور في 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
منشور في 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
منشور في 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
منشور في 2025احصل على النص الكامل
doctoralThesis -
5
The bus sightseeing problem
منشور في 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
منشور في 2019احصل على النص الكامل
doctoralThesis -
7
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
منشور في 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. …"
-
8
Quarantine-aware home healthcare routing and scheduling: a bi-objective approach
منشور في 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. …"
-
9
Transformations for Variants of the Travelling Salesman Problem and Applications
منشور في 2017احصل على النص الكامل
doctoralThesis -
10
On the periodic hierarchical Chinese postman problem
منشور في 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
منشور في 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. …"
احصل على النص الكامل
-
12
A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM
منشور في 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. …"
احصل على النص الكامل
article -
13
Optimization of Energy Consumption in Cloud Computing Datacenters
منشور في 2018احصل على النص الكامل
doctoralThesis -
14
Logic-based Benders decomposition combined with column generation for mobile 3D printer scheduling problem
منشور في 2025"…A mixed-integer linear programming model is proposed to describe this problem. …"
-
15
A comparative analysis of MIP formulations for the multi-mode resource-constrained independent task scheduling problem
منشور في 2025"…This problem commonly arises in the context of multiproject scheduling. …"
-
16
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
منشور في 2025"…This paper introduces and investigates two integer programming formulations for this problem. …"
-
17
Convex Hull Representations Of Models For Computing Collisions Between Multiple Bodies
منشور في 2020"…For the case of bodies having linear trajectories, we construct a convex hull representation of the integer programming model of S.Z. Selim and H.A. Almohamad [European Journal of Operational Research 119 (1) (1999) 121-129], and compare the relative effectiveness in solving this problem via the resultant linear program. …"
احصل على النص الكامل
article -
18
Collision Computation Of Moving Bodies
منشور في 2020"…The problem of finding the collision time and location of several moving bodies is cast as an integer programming problem. …"
احصل على النص الكامل
article -
19
A genetic algorithm for corrective retesting. (c1995)
منشور في 1995احصل على النص الكامل
احصل على النص الكامل
masterThesis -
20
Joint Planning of Smart EV Charging Stations and DGs in Eco-Friendly Remote Hybrid Microgrids
منشور في 2019"…This is achieved by iteratively solving a multi-objective mixed integer non-linear program. …"
احصل على النص الكامل
article