相关论文: On Solving Fixed Charge Transportation Problems Ha…
This work focuses on exact methods for a Simultaneous Vehicle Routing and Crew Scheduling Problem in long-haul transport. Pickup-and-delivery requests with time windows must be fullfiled over a multi-day planning horizon. Unlike some…
The Minimum Vertex Cover problem, a classical NP-complete problem, presents significant challenges for exact solution on large graphs. Fixed-Parameter Tractability (FPT) offers a powerful paradigm to address such problems by exploiting a…
A classic result of Lenstra [Math.~Oper.~Res.~1983] says that an integer linear program can be solved in fixed-parameter tractable (FPT) time for the parameter being the number of variables. We extend this result by incorporating…
Fixed-Point-Oriented Programming (FPOP) is an emerging paradigm designed to streamline the implementation of problems involving self-referential computations. These include graph algorithms, static analysis, parsing, and distributed…
We derive explicit solution representations for linear, dissipative, second-order Initial-Boundary Value Problems (IBVPs) with coefficients that are spatially varying, with linear, constant-coefficient, two-point boundary conditions. We…
We study the combinatorial FIFO Stack-Up problem, where bins have to be stacked-up from conveyor belts onto pallets. Given k sequences of labeled bins and a positive integer p, the goal is to stack-up the bins by iteratively removing the…
We present an efficient and parsimonious algorithm to solve mixed initial/final-value problems. The algorithm optimally limits the memory storage and the computational time requirements: with respect to a simple forward integration, the…
The Traveling Thief Problem (TTP) is a multi-component optimization problem that captures the interplay between routing and packing decisions by combining the classical Traveling Salesperson Problem (TSP) and the Knapsack Problem (KP). The…
The Dial-a-Ride Problem (DARP) is an optimization problem that involves determining optimal routes and schedules for several vehicles to pick up and deliver items at minimum cost. Motivated by real-world carpooling and crowdshipping…
We present an interval-based approach for parameter identification in structural static inverse problems. The proposed inverse formulation exploits the Interval Finite Element Method (IFEM) combined with adjoint-based optimization. The…
We present a new flux-fixup approach for arbitrarily high-order discontinuous Galerkin discretizations of the SN transport equation. This approach is sweep-compatible: as the transport sweep is performed, a local quadratic programming (QP)…
Many research has been conducted about quadratic programming and inverse optimization. In this paper we present the combination aspect of these subjects, applying on transportation problem. First, we obtain the inverse form of quadratic…
This thesis employs statistical learning technique to analyze, predict and solve the fixed charge network flow (FCNF) problem, which is common encountered in many real-world network problems. The cost structure for flows in the FCNF…
The calibration of volatility models from observable option prices is a fundamental problem in quantitative finance. The most common approach among industry practitioners is based on the celebrated Dupire's formula [6], which requires the…
With growing interest in sustainable logistics, electric vehicle (EV)-based deliveries offer a promising alternative for urban distribution. However, EVs face challenges due to their limited battery capacity, requiring careful planning for…
We propose a novel exact algorithm for the transportation problem, one of the paradigmatic network optimization problems. The algorithm, denoted Iterated Inside Out, requires in input a basic feasible solution and is composed by two main…
We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.…
We consider a multiple depot, multiple vehicle routing problem with fuel constraints. We are given a set of targets, a set of depots and a set of homogeneous vehicles, one for each depot. The depots are also allowed to act as refueling…
In this paper well-posedness is proved for an initial and boundary value problem (IBVP) relative to a large class of quasilinear hyperbolic systems, in $p+q$ equations, on a strip, arising from a model of $H_2O$-phase transitions in the…
Flux-corrected transport (FCT) is one of the flux limiter methods. Unlike the total variation diminishing methods, obtaining the known FCT formulas for computing flux limiters is not quite transparent, and their transformation is not…