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

The tail assignment problem is a critical part of the airline planning process that assigns specific aircraft to sequences of flights, called lines-of-flight...

In this paper we present a novel formulation based on a certain median function to solve discretely constrained mixed complementarity problems (MCPs). Such p...

Starting from the improved primal simplex (IPS) decomposition, introduced by Elhallaoui et al. (2011) to tackle degeneracy in general linear programs, we int...

Non-price attributes such as prior relationship, product quality, and reliability can be more important than bidding prices for the buyers when selecting the...

Cet article traite du problème de gestion de projet avec contraintes de ressources qui consiste à ordonnancer des activités de façon à minimiser le temps de ...

This paper addresses the optimization of mineral supply chain operations under metal and material type uncertainties. A mathematical model to simultaneously ...

This paper develops an efficient method to solve a typical combinatorial optimization problem that is frequently encountered when designing high levels of pr...

Dans cet article, nous étudions des stratégies pour résoudre le problème de partitionnement d'ensemble (PPE), en particulier les gains en efficacité qui pe...

Various disturbances such as adverse weather conditions may result in delayed or canceled flights and affect the optimized schedules planned for airline crew...

Cet article présente une approche structurée pour modéliser des contraintes logiques (expressions qui contiennent des propositions et des opérateurs logiques...

We propose a primal algorithm for the Set Partitioning Problem based on the Integral Simplex Using Decomposition of Zaghrouti et al. (2014). We present the a...

The maximally diverse grouping problem requires finding a partition of a given set of elements into a fixed number of mutually disjoint subsets (or groups) i...

In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation p-hub center problem (USApHCP). F...