Related papers: An improved solution approach for the Budget const…
In this paper, we present Approximation Schemes for Capacitated Vehicle Routing Problem (CVRP) on several classes of graphs. In CVRP, introduced by Dantzig and Ramser (1959), we are given a graph $G=(V,E)$ with metric edges costs, a depot…
Process Planning and Scheduling (PPS) is an essential and practical topic but a very intractable problem in manufacturing systems. Many research use iterative methods to solve such problems; however, they cannot achieve satisfactory results…
Operators who deploy large fleets of electric vehicles often face a challenging charge scheduling problem. Specifically, time-ineffective recharging operations limit the profitability of charging during service operations such that…
Logic-Based Benders Decomposition (LBBD) and its Branch-and-Cut variant, namely Branch-and-Check, enjoy an extensive applicability on a broad variety of problems, including scheduling. Although LBBD offers problem-specific cuts to impose…
The application of renewable energy is a promising solution to realize the Green Communications. However, if the cellular systems are solely powered by the renewable energy, the weather dependence of the renewable energy arrival makes the…
The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant…
We introduce the discrete-time treatment number of a graph, in which each vertex is in exactly one of three states at any given time-step: compromised, vulnerable, or treated. Our treatment number is distinct from other graph searching…
Recent studies on cloud-radio access networks assume either signal-level or scheduling-level coordination. This paper considers a hybrid coordinated scheme as a means to benefit from both policies. Consider the downlink of a multi-cloud…
Femtocells are recognized effective for improving network coverage and capacity, and reducing power consumption due to the reduced range of wireless transmissions. Although highly appealing, a plethora of challenging problems need to be…
This paper studies the non-preemptive single-machine scheduling problem with heterogeneous release times and processing times, with the objective of minimizing total waiting time. The problem is known to be NP-hard. By modeling machine idle…
The growing availability of second-life batteries (SLBs) from electric vehicles is reshaping future microgrid design, requiring planning frameworks that explicitly account for reduced capacity and efficiency over time. However, traditional…
Understanding the interactions between different combinatorial optimisation problems in real-world applications is a challenging task. Recently, the traveling thief problem (TTP), as a combination of the classical traveling salesperson…
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, we show how to build a Steiner forest spanner for such graphs.…
Control scheduling refers to the problem of assigning agents or actuators to act upon a dynamical system at specific times so as to minimize a quadratic control cost, such as the objective of the Linear-quadratic-Gaussian (LQG) or the…
A natural way to deal with multiple, partially conflicting objectives is turning all the objectives but one into budget constraints. Some classical polynomial-time optimization problems, such as spanning tree and forest, shortest path,…
We study the routing problem for vehicles with limited energy through a network of inhomogeneous charging nodes. This is substantially more complicated than the homogeneous node case studied in [1]. We seek to minimize the total elapsed…
Addressing the Integrated Timetabling and Vehicle Scheduling (TTVS) problem is important for improving transit operations. Recently, the emerging modular autonomous vehicles composed of modular autonomous units have made it possible to…
We give polynomial time logarithmic approximation guarantees for the budget minimization, as well as for the profit maximization versions of minimum spanning tree interdiction. In this problem, the goal is to remove some edges of an…
In this article, we propose a new method for solving the interval fixed charge transportation problem (IFCTP), wherein the parameters (associated cost, fixed cost, supply, and demand) are represented by interval numbers. First, an…
We consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling…