We investigate the complexity of openshop scheduling problems. A number of variations of the shop with different objective functions have been surveyed. The...

Global optimization problems with a few variables and constraints arise in numerous applications but are seldom solved exactly. Most often only a local opti...

We consider the problem of scheduling jobs on a single machine with generalized due dates. The due dates are given according to the position in which a job ...

The aim of this paper is the characterization and the computation of equilibrium solutions in multistage games represented by networks. More specifically, w...

The transient statistical evolution of a single product manufacturing system under hedging point control policies is characterized via a system of coupled p...

This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and exten...

Consider the optimal control problem for the two processor flow-shop when processing time is a (linear) function of the state. Since the latter also depends...

The interaction between a utility company and electricity cogenerators is modeled via a game-theoretic, systems analysis approach, under the assumption of a...

We consider projects represented by a PERT network, with convex cost-of-time functions on individual activities, and we show the existence of an efficient m...

The multiple vehicle many-to-many routing problem is presented in the context of a dial-a-ride system. It is solved by mini-clustering first and optimal ro...

We present an algorithm that solves the problem of finding the vehicle schedule which minimizes total inconveniences for travel along a fixed path, where se...

This paper establishes a relationship between the concept of hedging point, first introduced in the realm of FMS flow control models, and the turnpike prop...

We outline a system that is being designed to support the modeling of physical distribution situations and the selection or construction of algorithms for t...

In this paper, we address the problem of routing a fleet of vehicles from a central depot to customers with known demands. We consider the classical vehicle...

Piyavskii's algorithm maximizes a univariate function <i>f</i> satisfying a Lipschitz condition. We compare the numbers of iterations needed to obtain a bou...

The primal projective algorithm for linear programs with unknown optimal objective function value is extended to the case where one uses a weighted Karmarka...

This paper deals with an application of the projective algorithm to the solution of a generic nondifferentiable minimization problem. This problem is closel...

Le problème classique d'optimisation de la capacité des réseaux de télécommunications s'énonce comme suit: pour un réseau dont la structure, la demande et l...

Several single-commodity, two-commodity and multi-commodity flow formulations have recently been introduced for the travelling salesman problem. The purpose...

A certain sequential separability property is established, using a topological argument, and exploiting a convexity-type assumption about objects with direc...