Applications of Simplicial Decomposition with Nonlinear Column Generation to Nonlinear Network Flows

1997 ◽  
pp. 346-373 ◽  
Author(s):  
Torbjörn Larsson ◽  
Michael Patriksson ◽  
Clas Rydergren
Keyword(s):  
Column Generation ◽  
Network Flows ◽  
Simplicial Decomposition ◽  
Nonlinear Network

scholarly journals A column generation technique for routing and spectrum allocation in cloud–ready survivable elastic optical networks

2017 ◽  
Vol 27 (3) ◽  
pp. 591-603 ◽  
Author(s):  
Róża Goścień ◽  
Krzysztof Walkowiak
Keyword(s):  
Optical Networks ◽  
Column Generation ◽  
Network Flows ◽  
Optimization Problems ◽  
Average Distance ◽  
Spectrum Allocation ◽  
Algorithm Performance ◽  
Path Protection ◽  
Fast Development ◽  
Routing And Spectrum Allocation

AbstractDriven by increasing user requirements and expectations, the fast development of telecommunications networks brings new challenging optimization problems. One of them is routing and spectrum allocation (RSA) of three types of network flows (unicast, anycast, multicast) in elastic optical networks (EONs) implementing dedicated path protection (DPP). In the paper, we model this problem as integer linear programming (ILP) and we introduce two new optimization approaches—a dedicated heuristic algorithm and a column generation (CG)-based method. Then, relying on extensive simulations, we compare algorithm performance with reference methods and evaluate CG efficiency in detail. The results show that the proposed CG method significantly outperforms reference algorithms and achieves results very close to optimal ones (the average distance to optimal results was at most 2.1%).

Application of Column Generation for Train-set Scheduling Problems with Regular Maintenance Constraints

2012 ◽  
Vol 132 (1) ◽  
pp. 151-159
Author(s):  
Akiyoshi Ohno ◽  
Tatsushi Nishi ◽  
Masahiro Inuiguchi ◽  
Satoru Takahashi ◽  
Kenji Ueda
Keyword(s):  
Column Generation ◽  
Scheduling Problems

Research of nonlinear network connection based on scattering function

2010 ◽  
Vol 24 (2) ◽  
pp. 119-124 ◽  
Author(s):  
Chao Zhang ◽  
Fushun Nian ◽  
Shengli Liang ◽  
Zhiying Cao
Keyword(s):  
Scattering Function ◽  
Nonlinear Network ◽  
Network Connection

Review of Network Flow Algorithms David P. Williamson

2021 ◽  
Vol 52 (1) ◽  
pp. 12-15
Author(s):  
S.V. Nagaraj
Keyword(s):  
Graduate Students ◽  
Real World ◽  
Network Flow ◽  
Network Flows ◽  
Optimization Problems ◽  
Capacity Constraints ◽  
Incoming Flow ◽  
Network Flow Problems ◽  
Flow Problems ◽  
Real World Problems

This book is on algorithms for network flows. Network flow problems are optimization problems where given a flow network, the aim is to construct a flow that respects the capacity constraints of the edges of the network, so that incoming flow equals the outgoing flow for all vertices of the network except designated vertices known as the source and the sink. Network flow algorithms solve many real-world problems. This book is intended to serve graduate students and as a reference. The book is also available in eBook (ISBN 9781316952894/US$ 32.00), and hardback (ISBN 9781107185890/US$99.99) formats. The book has a companion web site www.networkflowalgs.com where a pre-publication version of the book can be downloaded gratis.

Sign in / Sign up

Export Citation Format

Share Document