Dantzig-Wolfe reformulation solved by Column Generation is an approach to obtain improved bounds for Mixed Integer Programs. A downside of this approach is t...

We consider the multicommodity network flow formulation of the Multiple Depot Vehicle Scheduling Problem (MDVSP) and investigate several strategies within a ...

Column generation for solving linear programs with a huge number of variables alternates between solving a master problem and a pricing subproblem to add var...

Scheduling often plays an important role in vehicle routing. This paper describes several applications in which the author has been involved in recent years...

We introduce a Laplacian and a signless Laplacian for the distance matrix of a connected graph, called the <i>distance Laplacian</i> and <i>distance signless...

In this paper we introduce the discrete time window assignment vehicle routing problem. This problem consists of assigning a single time window from a ...

We derive conditions on the functions \(\varphi\), \(\rho\), \(v\) and \(w\) such that the 0-1 fractional programming problem`(\max\limits_{x\in {0...

The purpose of this paper is to study the periodic arc routing problem when the arcs of a network behave as customers, and sufficient material is delivered s...

Application of the dispersion models in order to address the cannibalization phenomenon within franchised chains is a new approach. In this work we have deve...

Community detection in networks has been studied extensively in the last decade. Many criteria, expressing the quality of the partitions obtained, as well ...

Reduced RLT constraints are a special class of Reformulation-Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-...

Given a set of entities, cluster analysis aims at finding subsets, also called clusters or communities or modules, entities of which are homogeneous and well...

The production routing problem (PRP) concerns the production and distribution of a single product from a production plant to multiple customers using capacit...

We consider a two-period closed-loop supply chain (CLSC) game where a remanufacturer appropriates of the returns' residual value and decides whether to exc...

Finding clusters, or communities, in a graph, or network is a very important problem which arises in many domains. Several models were proposed for its solu...

The MaxSumSum (maximum diversity) problem consists of the selection of <i>p</i> facilities among <i>n</i> candidate locations in a way that the total sum ...

The airline fleet assignment problem (FAP) consists of assigning an aircraft type to each flight leg of a flight schedule in order to maximize the airline ...

Dynamic constraint aggregation (DCA) and dual variable stabilization (DVS) are two methods that can reduce the negative impact of degeneracy when solvi...

Stochastic programming can yield significant savings over deterministic approaches. For example, the stochastic approach for the shift scheduling problem sol...

Dispersion problems consist of the selection of a fixed number of vertices from a given set so that some function of the distances among the vertices is maxi...