نتایج جستجو برای: fixed charge capacitated multi commodity network design

تعداد نتایج: 2207707  

2008
B. Fortz M. Poss

Benders decomposition has been widely used for solving network design problems. In this paper, we use a branch-and-cut algorithm to improve the separation procedure of Gabrel et al. and Knippel et al. for capacitated network design. We detail experiments on bi-layer networks, comparing with Knippel’s previous results.

Journal: :Inf. Process. Lett. 2004
Raja Jothi Balaji Raghavachari

2004
Inmaculada Rodríguez Martín Juan José Salazar González

In this work we address a capacitated hub problem arising from a Telecommunications application. In this problem we must choose the routes and the hubs to use in order to send a set of commodities from sources to destinations in a given capacitated network with a minimum cost. The capacities and costs of the arcs and hubs are given, and the graph connecting the hubs is not assumed to be complet...

2013
MohammadTaghi Hajiaghayi Rohit Khandekar Guy Kortsarz Zeev Nutov

In the Fixed Cost k-Flow problem, we are given a graph G = (V,E) with edge-capacities {ue | e ∈ E} and edge-costs {ce | e ∈ E}, source-sink pair s, t ∈ V , and an integer k. The goal is to find a minimum cost subgraph H of G such that the minimum capacity of an st-cut in H is at least k. We show that the Group Steiner on Trees problem is a special case of Fixed Cost k-Flow. This implies the fir...

Journal: :Oper. Res. Lett. 2009
Bernard Fortz Michael Poss

Benders decomposition has been widely used for solving network design problems. In this paper, we use a branch-and-cut algorithm to improve the separation procedure of Gabrel et al. and Knippel et al. for capacitated network design. We detail experiments on bilayer networks, comparing with Knippel’s previous results.

Journal: :CoRR 2007
Ion I. Mandoiu Andrew B. Kahng Christoph Albrecht Alex Zelikovsky

In this paper we describe a new algorithm for buffered global routing according to a prescribed buffer site map. Specifically, we describe a provably good multi-commodity flow based algorithm that finds a global routing minimizing buffer and wire congestion subject to given constraints on routing area (wirelength and number of buffers) and sink delays. Our algorithm allows computing the tradeof...

2003
FERYAL ERHUN M. SELIM AKTURK AYTEN TURKCAN

In this study, we propose an analytical model to determine the withdrawal cycle length, kanban sizes and number of kanbans simultaneously in a multi-item, multi-stage, multi-period, capacitated periodic review kanban system. Traditionally, research in kanban systems has been separated into ‘design level’ research, and ‘shop floor level’ research. In both veins of research, especially for the de...

S. Gholizadeh, S. Mohammadhosseini,

The main aim of this study, is to evaluate the seismic reliability of steel concentrically braced frame (SCBF) structures optimally designed in the context of performance-based design. The Monte Carlo simulation (MCS) method and neural network (NN) techniques were utilized to conduct the reliability analysis of the optimally designed SCBFs. Multi-layer perceptron (MLP) trained by back propagati...

Journal: :Oper. Res. Lett. 2014
Young-Soo Myung Ilkyeong Moon

This paper considers a multi-port and multi-period container planning problem of shipping companies that use both standard and foldable containers. A company must decide which number of empty containers of each type to purchase and reposition at each port within a defined period to minimize the total purchasing, repositioning, and storage costs. Wedevelop amodel to optimally allocate both folda...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید