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...

In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order \(n\) and chromatic number ...

Two-level orthogonal designs play an important role in industrial screening experiments, in which the primary goal is to identify the treatment factors with ...

In this paper, we propose an integer programming model for obtaining lower bounds for the curriculum-based course timetabling problem, in which weekly assign...

This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility considerations. The resolution pro...

Synchronization of workers and vehicles plays a major role in many industries such as logistics, healthcare or airport ground handling. In this paper, we fo...

This paper studies the impact of service level constraints in the context of the capacitated and uncapacitated lot sizing problems with deterministic demand ...

Airline crew scheduling is typically performed in two steps : crew pairing followed by crew assignment. The crew pairing problem (CPP) finds a set of pairing...

We study a rich production-routing problem with time windows arising at a catering services company. The production part consists of assembling the meals to ...

The geometric-arithmetic index \(GA\) of a graph \(G\) is the sum of ratios, over all edges of \(G\), of the geometric mean to the arithmetic mean of t...

In the present paper, we compare the geometric-arithmetic index \(GA\) and the chromatic number \(\chi\) of a connected graph with given order. We prove,...

The technological developments observed in the last two decades contributed to the digitalization of products and the introduction of devices to consume th...

In this paper, we introduce a general framework for vector space decompositions that decompose the set partitioning problem into a reduced problem, defined...

The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited...

Inventory routing problems aim at minimizing the cost of the total distance traveled over a time horizon discretized in periods, while guaranteeing that th...

This paper introduces the pickup and delivery problem with time windows and handling operations. In this problem, the loading compartment of a vehicle is mod...

Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a...

Given a flight schedule and a set of aircraft of different types, the airline fleet assignment problem (FAP) consists of assigning an aircraft type to each f...

We model and solve the problem of sequencing a set of jobs with specified processing times and tool requirements on a set of identical parallel machines. D...