skip to content

Soumis, François 1946-

Overview
Works: 152 works in 396 publications in 2 languages and 572 library holdings
Roles: Author
Classifications: HD30.23, 380
Publication Timeline
Key
Publications about François Soumis
Publications by François Soumis
Most widely held works by François Soumis
The dynamic predicate stashing copy problem by Brunilde Sansó( Book )
17 editions published between 1991 and 1993 in English and held by 20 libraries worldwide
One important issue being addressed in the design of distributed computer networks is how to increase the availability of time-changing information even in the event of failures. Recently, a technique called stashing was proposed in which a copy of a file was placed in several nodes of the network. In addition, a predicate was defined as a consistency requirement for a particular file copy with respect to the original. This paper addresses the problem of minimizing the propagation cost of stashed copies subject to time predicate restrictions imposed by the user, where the user may receive a copy with a predicate better than requested. This problem is called the dynamic predicate stashing copy problem and a formulation is proposed to solve it. Resolution approaches, numerical results, and properties of the problem are also discussed
Routes avec contraintes d'horaires by Jacques Desrosiers( Book )
9 editions published between 1981 and 1982 in French and held by 16 libraries worldwide
A Dynamic programming method for the large scale single vehicle dial-a-ride problem with time windows by Jacques Desrosiers( Book )
9 editions published between 1984 and 1986 in English and held by 14 libraries worldwide
Expected distances between two random points in rectangles and rectangular parallelepipeds by B Gaboune( Book )
9 editions published between 1982 and 1992 in English and held by 12 libraries worldwide
This paper provides analytical expressions for the expected distance between two randomly and uniformly distributed points in a rectangle or in a rectangular parallelepiped under the Manhattan metric, the Euclidean metric, and the Chebychev metric systems
Communication and transportation networks reliability using routing models by Brunilde Sansó( Book )
7 editions published between 1987 and 1990 in English and held by 12 libraries worldwide
A general framework for calculating a reliability measure for several types of flow networks is presented. This framework allows the performance of reliability analysis for complex systems such as communication, electric power and transportation networks. The analysis is based on the notion of routing and re-routing after a failure and different modelling approaches are discussed for every type of system surveyed
The multiple vehicles many to many routing problem with time windows by Jacques Desrosiers( Book )
8 editions published between 1984 and 1986 in English and held by 11 libraries worldwide
Examines the optimiation of vehicle routes in a large scale multi-vehicle many-to-many system, presented in the context of the transportation of the handicapped
A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem by Anne Mercier( Book )
6 editions published between 2003 and 2004 in English and held by 10 libraries worldwide
On the evaluation of telecommunications network reliability using routing models by Brunilde Sansó( Book )
6 editions published between 1988 and 1990 in English and held by 10 libraries worldwide
Optimal strip sequencing strategies for flexible manufacturing operations in two and three dimensions by B Gaboune( Book )
6 editions published in 1992 in English and held by 9 libraries worldwide
Centralized and decentralized stochastic models in telecommunication networks by Brunilde Sansó( Book )
8 editions published between 1990 and 1991 in English and held by 9 libraries worldwide
This paper presents and compares two routing models characterized by two different routing policies for circuit-switched telecommunications networks. The first model is for a centralized optimization routing policy while the second model obeys a decentralized type of routing. Both models are formulated so that the stochastic character of the demand is taken into account. The two models are solved by the same type of algorithm, a convex simplex implementation, adapted differently according to the model. Comparative results between the two policies are discussed
Planification d'une flotte d'avions by François Soumis( Book )
3 editions published in 1978 in French and held by 8 libraries worldwide
Routes sur un réseau espace-temps by Jacques Desrosiers( Book )
3 editions published in 1982 in French and held by 8 libraries worldwide
Classification of traveling salesman problem formulations by André Langevin( Book )
6 editions published between 1988 and 1989 in English and held by 8 libraries worldwide
Schedule efficiency in a robotic production cell by I Ioachim( Book )
7 editions published between 1993 and 1994 in English and held by 8 libraries worldwide
The simultaneous origin-destination assignment and vehicle routing problem by François Soumis( Book )
8 editions published between 1988 and 1990 in English and held by 8 libraries worldwide
Lagrangian relaxation for routing with time windows by Jacques Desrosiers( Book )
6 editions published between 1983 and 1984 in English and held by 8 libraries worldwide
Vehicle routing with full loads by Jacques Desrosiers( Book )
5 editions published in 1985 in English and held by 7 libraries worldwide
Paper considers a vehicle routing problem with full loads and maximum length constraints, formulated as an asymmetrical travelling salesman problem with two types of restrictions. When these restrictions are not too stringent, the problem can be solved optimally for relatively large sizes.[$
A generalized permanent labelling algorithm for the shortest path problem with time windows by M Desrochers( Book )
6 editions published between 1985 and 1986 in English and held by 7 libraries worldwide
Time window constraints are rapidly becoming a popular way to model suchthings as openinghours of customer, and preferred delivery time in many scheduling androuting problems. The shortest path problem with time windows consists offinding the least cost route between a source and a sink in a network whilerespecting specific time windows at each visited node. The duration of eacharc is restricted to positive values while the cost of each arc isunrestricted. This report presents an efficient generalized permanentlabelling algorithm to solve this problem. This new alogrithm is based onthe definition of concept of a generalized bucket and on a specific order ofhandling the labels. The algorithm runs in pseudo-polynomial time, andproblems with up to 2500 nodes and 250,000 arcs have been solved
A dynamic passenger assignment model on a congested radial transit network by Slim Saïdi( Book )
4 editions published in 1995 in English and held by 7 libraries worldwide
Transit networks, user behaviour, congestion, capacity, departure time
 
moreShow More Titles
fewerShow Fewer Titles
Alternative Names
Soumis, F. 1946-
Soumis, F. (François), 1946-
Languages
English (118)
French (15)
Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.