A matheuristic approach for solving the 2-connected dominating set problem by 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 by 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 by 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 by Albinali, Hamad A.Rahman

Get full text

The bus sightseeing problem by 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 by Madani, Batool Mezar

Get full text

Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets by 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. …”

Quarantine-aware home healthcare routing and scheduling: a bi-objective approach by 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. …”

Transformations for Variants of the Travelling Salesman Problem and Applications by Assaf, Mustafa Jamil

Get full text

On the periodic hierarchical Chinese postman problem by 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 by 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. …”
Get full text

A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM by 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. …”
Get full text

Optimization of Energy Consumption in Cloud Computing Datacenters by Osman, Ahmed Osman

Get full text

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

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

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

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

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

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

Convex Hull Representations Of Models For Computing Collisions Between Multiple Bodies by Sherali, H.D.

“…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. …”
Get full text

Collision Computation Of Moving Bodies by Selim, S.Z.

“…The problem of finding the collision time and location of several moving bodies is cast as an integer programming problem. …”
Get full text

A genetic algorithm for corrective retesting. (c1995) by Fakih, Khaled A.

Get full text
Get full text

Joint Planning of Smart EV Charging Stations and DGs in Eco-Friendly Remote Hybrid Microgrids by Shaaban, Mostafa

“…This is achieved by iteratively solving a multi-objective mixed integer non-linear program. …”
Get full text