Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex <i>s</i> to a vertex <i>t</i> with the smallest possible range of a...

In this paper a new approach for the facility layout problem is presented. This approach combines genetic algorithms with linear programming to design the ...

We consider the problem of minimizing, over a fixed horizon, the peak load in single-command cycle dedicated storage policies. The daily load is the expecte...

The multi-depot vehicle scheduling problem with time windows consists of scheduling a fleet of vehicles to cover a set of tasks at minimum cost. Each task i...

A review is made of models and algorithms for probabilistic satisfiability and its extensions. The basic probabilistic satisfiability problem, in decision f...

Extension of input-output functions for generating units allows simultaneous solution of the static unit commitment and economic dispatch problems by dynami...

Let <i>G =</i> (<i>V,E</i>) be an undirected graph and <i>c</i> any vector in Z₊^{<i>V</i>(<i>G</i>)}. Denote by <img src="chi.gif" alig...

In the Generalized Traveling Salesman Problem (GTSP), the aim is to determine a least cost Hamiltonian circuit or cycle through several clusters of vertic...

The problem of assigning locomotives to train-segments is very important for railway companies, in view of the high cost of operating locomotives. The prob...

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time window...

In the airline industry, crew schedules consist of a number of pairings. These are round trips originating and terminating at the same crew home base compo...

We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph...

The maxmin problem models a game sequentially played by two players having opposite objective. Before making his move, the first player must anticipate the...

A mixed graph <i>G_{<img src="theta.gif">}</i> contains both undirected edges and directed arcs. A <i>k</i>-coloring of <i>G<sub><img src="theta.g...

The majority of vehicle routing and crew scheduling problems studied up to date in the literature can be formulated by means of a unified model introduced b...

A government wishes to accelerate the adoption of a new technology in order to gradually replace an older one. The new technology is manufactured by a mono...

We study links between the bilevel linear and linear mixed 0-1 programming problems. A new reformulation of the linear mixed 0-1 programming problem into a...

In this paper we derive lower bounds on the size of a minimum cover of a graph <i>G</i> by computing packings of edges, odd cycles and cliques of <i>G</i> o...

In this paper we tackle the problem of jointly finding the optimal location of the ATM switches, the topology of the backbone and local access networks, the...

Multiobjective decision making problems occur in a variety of transportation planning settings. These are often ill-defined and may involve several players...