Personnel scheduling consists of determining least-cost employee work schedules to cover the demand of one or several jobs in each period of a time horizon. ...

The problem of output stabilization is studied for a class of linear hybrid systems subject to signal uncertainties: linear impulsive systems under dwell-t...

The maximum $k$-colorable subgraph problem ($k$-MCSP) is to color as many vertices as possible with at most $k$ colors, such that no two adjacent...

This paper examines the issue of price and advertising coordination in bilateral monopolies from a dynamic perspective. Its main objectives are to design i...

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

With the emphasis on renewable energy integration, stochastic methods have begun to emerge as one of the most viable alternatives to traditional deterministi...

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

This paper investigates the dynamic pricing strategies of firms selling complementary products in a marketing channel. The problem is modelled as a non-coo...

Currently, power system operations planning practices are undergoing various transformations in an attempt to integrate efficiently significant amounts of su...

Given a complete directed graph $G$ with weights on the vertices and on the arcs, a $\theta$-improper $k$-coloring is an assignment of at most `...

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

This paper describes three recent tools for dealing with primal degeneracy in linear programming. The first one is the Improved Primal Simplex (IPS) algor...

Since its introduction in 1969, the set partitioning problem has received much attention, and the structure of its feasible domain has been studied in detail...

Modern power systems are undergoing a transitional phase, increasingly incorporating variable generation (VG) to harness the economic and environmental benef...

Until recently, graph coloring being a computationally difficult problem, completely dynamic channel allocation was not considered in large scale networks. T...

We characterize equilibrium pricing strategies in a marketing channel in two scenarios. In the first scenario, the manufacturer chooses the wholesale price...

The <b>VRPTW-ST</b> introduced by Errico et al. (2013) in the form of a chance-constrained model mainly differs from other vehicle routing problems with st...

In this paper we consider the vehicle routing problem with hard time windows and stochastic service times (VRPTW-ST); in this variant of the classic VRPTW ...

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

Given a directed graph with weights on the vertices and on the arcs, a &theta;-improper <i>k</i>-coloring is an assignment of at most <i>k</i> different colo...