This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed by Goldberg ...

We introduce iterative methods named TriCG and TriMR for solving symmetric quasi-definite systems based on the orthogonal tridiagonalization process proposed...

Algorithm NCL is designed for general smooth optimization problems
    where first and second derivatives are available,
    including problems whose constrai...

Personnel scheduling aims to determine least-cost personnel schedules to meet the demand for employees in each period of a planning horizon. In this article,...

This paper presents an algorithm for the identification of parameters for a stochastic hot water end-use process that drives a homogeneous population of ther...

Energy generation has always been a major stake in our economy and is all the more so with the increase in energy demand all over the world. In that context,...

The personalized crew rostering problem (CRP) consists of assigning pairings (sequences of flights, deadheads, connections, and rests, forming one or several...

The crew pairing problem (CPP) is solved in the first step of the crew scheduling process. It consists of creating a set of pairings (sequence of flights, co...

We consider logistic collaborations where multiple carriers collaborate by consolidating demands, combining delivery routes, and serving new customers. Logis...

We study a class of deterministic two-player nonzero-sum differential games where one player uses piecewise-continuous controls to affect the continuously e...

We consider the problem of a government that wishes to promote replacing old cars with new ones via a vehicle scrappage program. Since these programs incre...

In this paper, we study the time consistency of cooperative agreements in dynamic games with nontransferable utility. An agreement designed at the outset of ...

We represent a closed-loop supply chain formed of one manufacturer and one retailer as a dynamic game played over an event tree, which naturally allows to ...

We consider a two-stage game in a differentiated duopoly, where firms can pursue both a financial and an environmental objective. We assume that the maximu...

Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based driver preferences (DAPGDP) aims at building rosters tha...

We consider computationally expensive blackbox optimization problems and present a method that employs surrogate models and concurrent computing at the searc...

We study a new variant of the well-studied Vehicle Routing Problem with Time Windows (VRPTW), called the fragility-constrained VRPTW, which assumes that ...

Berth allocation and pilotage planning are the two most important decisions made by a seaport for serving incoming vessels. Traditionally, the berth allocati...

This work investigates lot-sizing with component substitution under demand uncertainty. The integration of component substitution with lot-sizing in an uncer...

Generation expansion planning (GEP) is a classical problem that determines an optimal investment plan for existing and future electricity generation technolo...