Given an integer solution, the integral simplex using decomposition (ISUD) seeks a descent direction that leads to an improved adjacent integer solution. It ...

The integral simplex using decomposition (ISUD) algorithm was recently developed to solve efficiently set partitioning problems containing a number of variab...

The bid construction problem (BCP) for combinatorial total truckload transportation service procurement auctions consists of determining one or several bids ...

A performance-based mechanism as a support for an environmental protection law is proposed to promote product recovery and to subside the pollution caused by...

In this paper, we evaluate the competitiveness of electric commercial vehicle (ECV) in medium-duty mid-haul logistics for a specific case study. This is done...

Electric commercial vehicles (ECVs) are gaining importance as they are seen to provide a sustainable mean of transportation. However, practitioners still see...

This paper reviews the literature on vehicle routing problems and location-routing problems with intermediate stops. Besides providing concise paper excerpts...

The purpose of this paper is to develop a fast heuristic called FastCARP for the solution of very large-scale capacitated arc routing problems, with or witho...

Scheduling problems on which constraints are imposed with regard to the temporal distances between successive executions of the same task have numerous appli...

In this article we consider a bi-objective vehicle routing problem in which, in addition to the classical minimization of the total routing cost, the operato...

Personnel scheduling consists of determining least-cost employee work schedules to cover the demand of one or several jobs in each period of a time horizon. ...

In this article, we discuss an alternative method for deriving conservative approximation models for two-stage robust optimization problems. The method main...

Location-routing problems (LRPs) with intra-route facilities have recently gained the attention of researchers and practitioners. Intra-route facilities are ...

The aim of this paper is to computationally compare several algorithms for the Minimum Cost Perfect Matching Problem on an undirected graph. Our work is moti...

Necessary and sufficient conditions are provided for the existence of a simple graph, or a simple connected graph with given numbers $m_{ij}$ of edges ...

This paper addresses the solution of the capacitated minimum cost flow problem on a network containing $n$ nodes and $m$ arcs. Satisfying necessary ...

While the joint optimization of production and outbound distribution decisions in a manufacturing context has been intensively studied in the past decade, th...

The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph $G$ are the spectra of the distance, distance Laplacian and...

The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 ...

Branch-price-and-cut is a leading methodology for solving various vehicle routing problems (VRPs). For many VRPs, the pricing problem of a branch-price-and-c...