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

In this paper a new branch-price-and-cut method for a maritime inventory routing problem for one of the world's largest producers of liquefied natural gas (L...

The inventory routing problem (IRP) and the production routing problem (PRP) are two difficult problems arising in the planning of integrated supply chains...

The problem of coordinating a fleet of vehicles so that all demand points on a territory are serviced and that the workload is most evenly distributed among ...

A game theoretical model featuring a manufacturer and two dealers is proposed to investigate the effects of downstream horizontal integration on network perf...

We consider a Closed-loop supply chain (CLSC) with a single manufacturer and a single retailer. We characterize and compare the feedback equilibrium resul...

A significant game-theoretic literature on the coordination of distribution channels has developed over the past three decades. We provide an extensive analy...

In an onshore oil field, the productivity of oil wells decreases when they require maintenance. To restore full productivity at a well, it must be visi...

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

We introduce a Laplacian for the distance matrix of a connected graph, called the <i>distance Laplacian</i> and we study its spectrum. We show the equivalenc...

In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the or...

The Job Grouping Problem consists of assigning a set of jobs, each with a specific set of tool requirements, to machines with a limited tool capacity in orde...

Column generation for solving linear programs with a huge number of variables alternately solves a (restricted) master problem and a pricing subproblem to ad...

The min-max <i>k</i>-vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle in order to find a set of b...