The shortest path problem with resource constraints consists of finding the minimum cost path between two specified points while respecting constraints on r...

Goal Programming with fractional objectives can be reduced to mathematical programming with a linear objective under linear and quadratic constraints, thus...

The pooling problem, which is fundamental to the petroleum industry, describes a situation where products possessing different attribute qualities are mixed...

The AutoGraphiX (AGX) system determines classes of extremal or near extremal graphs with a Variable Neighborhood Search heuristic. From these, conjectures m...

This article considers the (1|<i>X_p</i>-medianoid problem on a network <i>N</i>=(<i>V,E</i>) with vertex and edge demands. There are already <i>p...

The purpose of this article is to describe several applications of the Clustered Traveling Salesman Problem arising in areas as diverse as vehicle routing, ...

This paper contains a new convergence analysis for the Lewis and Torczon GPS class of pattern search methods for linearly constrained optimization. The ana...

Eugène is a sophisticated mixed integer linear programming model developed to help regional decision makers on long-term planning for solid waste management...

This paper introduces a new kind of operational crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight depart...

This article traces the evolution of ambulance location and relocation models proposed over the past thirty years. The models are classified in two main ca...

In the literature, thermal insulation systems with a fixed number of heat intercepts have been optimized with respect to intercept locations and temperature...

This paper describes and solves the operational pilot scheduling problem for one day of operations. The problem consists in simultaneously modifying, as nec...

The <i>p</i>-Center problem consists in locating <i>p</i> facilities and assigning clients to them in order to minimize the maximum distance between a clien...

This article reports on some recent algorithmic development for the <i>Rural Postman Problem</i> (CPP) and for the <i>Capacitated Arc Routing Problem</i> (C...

La Recherche à Voisinage Variable (RVV) est une métaheuristique récente basée sur l'idée d'un chargement systématique de voisinage, à la fois dans une phase...

An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity...

In this paper, we survey applications and algorithms pertaining to an important class of price setting problems formulated in the framework of bilevel progr...

Variable Neighborhood Search (VNS) is a recent metaheuristic which exploits systematically the idea of change of neighborhood within the search. After recal...

In this paper, we study the aircraft loading problem (ALP) which consists of transporting a series of items between two different points by aircraft at a mi...

Given a set of logical sentences and probabilities that these sentences are true, the probabilistic logic problem consists in determining whethe...

This paper deals with the class of uncertain systems with muliple time-delays. The stability and stabibizability of this class of systems are considered. Th...

This work develops a class of stochastic optimization algorithms. It aims to provide numerical procedures for solving threshold-type optimal control probl...

We consider a given set of offshore platforms and onshore wells, producing known (or estimated) amounts of oil, to be connected to a port. Connections may t...

Clique partitionning in Euclidean space <b>R</b>ⁿ consists in finding a partition of a given set of <i>N</i> points into <i>M</i> clusters in ord...

The set of equilibrium points of a bimatrix game is the union of polytopes that are not necessarily disjoint. Knowledge of the vertices of these polytopes ...

We modify the algorithm of Pardalos and Rodgers [40] for the minimization of a pseudo-boolean quadratic function by introducing an easy to compute lower bou...

A Basic Variable Neighbourhood Search heuristic is applied to min-max global optimization problems. The method is tested on the spread spectrum radar polyph...

Given a set of logical sentences together with nonnegative weights assigned to each of them, the Maximum Weight Satisfiability problem (MAX-WEIGHT SAT) cons...

This paper studies the class of uncertain linear systems with time-delay and Markov jump disturbance, in which the time-delay is assumed to be dependent on...

We review the work of B. Roy in graph theory and its posterity.

Since Hinkley's original work on exact inference for a change in a sequence of random variables, many authors have proposed different methods based either o...

Assigning locomotives and cars to a set of scheduled trains is a complex but important problem for passenger railways. This task is normally carried out in ...

The operating schedule problem in open-pit mine can be associated with the problem of maximal closure on a graph. In the literature, the Lagrangian relaxati...

This report deals with the stability and stabilizability of dynamical systems with time-delay. Sufficient conditions are developed to check whether a system...

This document deals with the robustness of stochastic stability and stabilizability of the class of dynamical deterministic systems with time-delay in the v...

The continuous <i>p</i>-defense-sum problem consists of locating <i>p</i> facilities in a convex polyhedron, such that the sum of the distances among all th...

This report deals with the class of dynamical uncertain systems with Markov jumps and time-delay. We consider the stochastic stability and stochastic stabil...

This report deals with the class of uncertain dynamical systems with Markov jumps and time-delay. The problems of robust stability and stabilizability are c...

We propose a network design model for flat networks using hybrid optical/electronic equipments. We describe a set of network components that can be taken in...

Le problème de plus court chemin avec contraintes de ressources consiste à trouver un chemin d'un point origine à un point destination de coût minimum et re...

We present a fast tabu search method for the design of access tree networks. We connect a population of users to a set of switches using a variety of SONET ...

In a research synthesis on the prognosis of depression, the outcome of interest has a multinomial distribution with the following typical categories: well, ...

Ce papier présente une nouvelle procédure de classification, appelée PROCFTN, basée sur le domaine de l'aide multicritère à la décision. Le principe général...

The search for optimal non-parametric estimates of the cumulative distribution and hazard functions under order constraints inspired at least two earlier cl...

We consider a bilevel programming formulation of a freight tariff setting problem where the leader consists in one among a group of competing carriers and t...

Given a set of flight legs to be flown by a single type of aircraft, the simultaneous aircraft routing and crew scheduling problem consists of determining a...

Cet article de vulgarisation donne un bref aperçu des travaux réalisés en gestion des opérations dans les grands réseaux de transport. On y fait principalem...

A combinatorial approach is used to derive asymptotic expressions for arbitrary moments of cumulative vector processes, as the time horizon goes to infinity...

Let <i>G</i> be a multigraph containing no minor isomorphic to <i>K</i>_3,3 or <i>K</i>₅<i>e</i> (where <i>K</i>₅<i>e</i> de...

There is an increasing interest for efficient synthesis methods (routing and dimensioning) of large and robust multi-service networks. In the case of ATM ne...

In several arc routing problems, it is necessary to take turn penalties into account when designing a solution. Traditionally, this is done through a trans...

The standard way to solve the static economic dispatch problem with transmission losses is the penalty factor method. The problem is solved iteratively by a...

We analyze an analytic center cutting plane algorithm for the convex feasibility problems with semidefinite cuts. At each iteration the oracle returns a ...

One important challenge in nonparametric density and regression-function estimation is spatially inhomogeneous smoothness. This is often modelled by Besov-t...

We consider a case of the convex feasibility problem where the set is defined by an infinite number of certain strongly convex self-concordant inequalities....

Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...

This paper presents a survey of the research on the Vehicle Routing Problem with Time Windows (VRPTW), an extension of the Capacitated Vehicle Routing Probl...

A model for the optimal location of new facilities in a competitive market is introduced under the hypothesis that customers' behavior can be modeled by ran...

This paper presents a survey on the <i>Vehicle Routing Problem with Pickup and Delivery</i> in which a heterogeneous vehicle fleet based at multiple termina...

Weber's problem is to locate a facility in the Euclidean plane in order to minimize total transportation costs from that facility to a given set of users wi...

The aim of this paper is to provide a concise portrayal of medical applications of a new fuzzy classification method called PROAFTN, which uses a multicrite...

This paper examines dynamic advertising and promotion strategies in a marketing channel where the retailer promotes the manufacturer's product, and the manu...

In this paper we propose a framework for the overall design problem of internet protocol (IP) networks with performance guarantees that includes the locatio...

This paper presents a mixed 0-1 linear programming model for the metropolitan area network (MAN) expansion problem. The model includes the location of new...

We consider the problem of determining a set of optimal tolls on the arcs of a multicommodity transportation network. The problem is formulated as a bilevel...

Logistics and transportation decision support systems rely on models of travel distance for evaluating scenarios and estimating costs. This paper presents a...

We propose an overall reconstruction of the traditional genetic algorithm method so that its inherent weaknesses such as slow convergence can be overcome. ...

This case study analyses the use and sharing of a logistics package, a returnable container, between Canada Post and its large mailing customers. Canada Po...

This paper deals with the inventory control problem for production system in which the produced items are supposed to be deteriorating with fixed rates. The...

Snow removal and disposal are important and expensive winter operations in many cities. When a large amount of snow accumulates in an urban area and impedes...

We consider a quadratic cut method based on analytic centers for two cases of convex quadratic feasibility problems. In the first case, the convex set is de...

This article examines arc routing problems from the "dual" perspective of node routing. It first attempts to explain why and how an arc routing problem shou...

In the set of bicolored trees with given numbers of black and of white vertices we describe those for which the largest eigenvalue is extremal (maximal or m...

It is shown that a geometrically planar fusene is uniquely determined by its boundary edge code. Surprisingly, the same conclusion is not true in general b...

Mirkin's additive clustering (or qualitative factor analysis) algorithm explains similarities between entities by sequentially finding a cluster of entities...

Eugène est un modèle dynamique de programmation linéaire mixte qui constitue un outil d'aide à la décision efficace pour les décideurs impliqués dans la pla...

A method to generate lower bounds for the channel assignment problem is given. The method is based on the reduction of the channel assignment problem to a p...

This article was written for the <i>Encyclopedia of Optimization.</i>

Cellular networks are generally modeled as node-weighted graphs, where the nodes represent cells and the edges represent the possibility of radio interferen...

Quatre regards sur la découverte, ceux du psychologue, de l'historien, du sociologue et du cognicien sont évoqués en quelques remarques illustrées d'exemples.

This article was written for the <i>Encyclopedia of Optimization.</i>

In cellular networks, channels must be assigned to call requests so that interference constraints are respected and bandwidth is minimized. The number of ca...

Variable Neighborhood Search is a recent metaheuristic based on the idea of systematic change of neighborhood during both a descent phase and an exploration...

The paper deals with the problem of sustaining over time a coordinated outcome in a two-member channel of distribution. In a dynamic game of pricing and ad...

Changes in financial market are collective human decisions which are result of the dynamics of the neurons. In this paper, we describe a discrete time Recur...