Results 101 to 110 of about 957 (221)
Solving multicommodity flow problems by an approximation scheme
, 2005 We study an approximation scheme to solve minimum cost multicommodity flow problems to a relative accuracy of epsilon is an element of (0, 1]. The proposed scheme, which we shall call Algorithm A, is a bisection-based procedure, so it maintains an ...
Villavicencio, J
core +1 more source
Fast Approximation Algorithm for Minimum Cost Multicommodity Flow
, 1995 Minimum-cost multicommodity flow problem is one of the classical optimization problems that arises in a variety of contexts. Applications range from finding optimal ways to route information through communication networks to VLSI layout.
Anil Kamath, Serge Plotkin, Omri Palmon
core
Multicommodity routing optimization for engineering networks. [PDF]
Sci Rep, 2022 Lonardi A, Putti M, De Bacco C.
europepmc +1 more source
Joint optimization of high-speed train timetables, speed levels and stop plans for increasing capacity based on a compressed multilayer space-time network. [PDF]
PLoS One, 2022 Chen A, Zhang X, Chen J, Wang Z.
europepmc +1 more source
, 2004 The problem of rerostering nurse schedules arises in hospitals when at least one nurse informs that she will be unable to perform the shifts assigned to her on one or more future work days.
Moz, Margarida, Pato, Margarida Vaz
core +1 more source
A Survey of Algorithms for Convex Multicommodity Flow Problems
, 1997 There are many problems related to the design of networks. Among them, the message routing problem plays a determinant role in the optimization of network performance.
Vial, Jean-Philippe +2 more
core
A Survey of Algorithms for Convex Multicommodity Flow Problems
Routing problems appear frequently when dealing with the operation of communication or transportation networks. Among them, the message routing problem plays a determinant role in the optimization of network performance.
A. Ouorou, P. Mahey, J.-Ph. Vial
core +1 more source
A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
International Journal of Industrial Engineering and Production Research, 2012 The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics ...
,
doaj
Addressing consistency and demand uncertainty in the Home Care planning problem. [PDF]
Flex Serv Manuf J, 2022 Cappanera P, Scutellà MG.
europepmc +1 more source
Interior Point Methods With Decomposition For Multicommodity Flow Problems [PDF]
, 2000 Projet MOCOAThis paper introduces an approach by decomposition of an interior point method for solving multicommodity flow problems. First, we present this approach in the general framework of coupling constraints problems. Next, we propose to specialize
Haddou, Mounir +3 more
core +1 more source