All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 7 Next

Displaying 121 – 140 of 146

Showing per page

Service network design in short and local fresh food supply chain

Maxime Ogier, Van-Dat Cung, Julien Boissière (2013)

RAIRO - Operations Research - Recherche Opérationnelle

This paper aims at developing efficient solving methods for an original service network design problem imbued with sustainable issues. Indeed the network has to be designed for short and local supply chain and for fresh food products. The original features of the problem are the seasonality of supply, the limitation of transshipments for a product and no possibility of storage between consecutive periods. Decisions at strategic and tactical level are (1) decisions on a subset of hubs to open among...

Signpost systems and spanning trees of graphs

Ladislav Nebeský (2006)

Czechoslovak Mathematical Journal

By a ternary system we mean an ordered pair ( W , R ) , where W is a finite nonempty set and R ⊆ W × W × W . By a signpost system we mean a ternary system ( W , R ) satisfying the following conditions for all x , y , z ∈ W : if ( x , y , z ) ∈ R , then ( y , x , x ) ∈ R and ( y , x , z ) ∉ R ; if x ≠ y , then there exists t ∈ W such that ( x , t , y ) ∈ R . In this paper, a signpost system is used as a common description of a connected graph and a spanning tree of the graph. By a ct-pair we mean an ordered pair ( G , T ) , where G is a connected graph and T is a spanning tree of G . If ( G , T ) is a ct-pair, then by the guide to...

Sur les α -flots

W. Bienia, V. Letrouit (1997)

RAIRO - Operations Research - Recherche Opérationnelle

Symmetric flows and broadcasting in hypercubes

Jean-Claude Bermond, A. Bonnecaze, T. Kodate, Stéphane Pérennes, Patrick Solé (1999)

Annales de l'institut Fourier

In this paper, we propose a method which enables to construct almost optimal broadcast schemes on an n -dimensional hypercube in the circuit switched, Δ -port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property is insured...

Synchronized traffic plans and stability of optima

Marc Bernot, Alessio Figalli (2008)

ESAIM: Control, Optimisation and Calculus of Variations

The irrigation problem is the problem of finding an efficient way to transport a measure μ+ onto a measure μ-. By efficient, we mean that a structure that achieves the transport (which, following [Bernot, Caselles and Morel, Publ. Mat.49 (2005) 417–451], we call traffic plan) is better if it carries the mass in a grouped way rather than in a separate way. This is formalized by considering costs functionals that favorize this property. The aim of this paper is to introduce a dynamical cost functional...

The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks

Krzysztof Walkowiak (2002)

International Journal of Applied Mathematics and Computer Science

Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination...

The maximum capacity shortest path problem : generation of efficient solution sets

T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum Capacity Shortest...

The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2010)

RAIRO - Operations Research

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum Capacity...

Traffic plans.

Marc Bernot, Vicent Caselles, Jean-Michel Morel (2005)

Publicacions Matemàtiques

In recent research in the optimization of transportation networks, the problem was formalized as finding the optimal paths to transport a measure y+ onto a measure y- with the same mass. This approach is realistic for simple good distribution networks (water, electric power,. ..) but it is no more realistic when we want to specify who goes where, like in the mailing problem or the optimal urban traffic network problem. In this paper, we present a new framework generalizing the former approathes...

Currently displaying 121 – 140 of 146