Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm [PDF]
Journal of Graph Algorithms and Applications, 2020 The minimum-cost flow (MCF) problem is a fundamental optimization problem with many applications and seems to be well understood. Over the last half century many algorithms have been developed to solve the MCF problem, and these algorithms have varying ...
Kamiel Cornelissen, Bodo Manthey
doaj +5 more sources
An Efficient Extension of Network Simplex Algorithm [PDF]
Journal of Optimization in Industrial Engineering, 2010 In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time.
Hassan Rashidi, Edward P.K Tsang
doaj +1 more source
A network simplex algorithm for simple manufacturing network model
Journal of Industrial and Management Optimization, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liqun Qi, Zengxin Wei
exaly +3 more sources
A dual exterior point simplex type algorithm for the minimum cost network flow problem [PDF]
Yugoslav Journal of Operations Research, 2009 A new dual simplex type algorithm for the Minimum Cost Network Flow Problem (MCNFP) is presented. The proposed algorithm belongs to a special 'exterior- point simplex type' category.
Geranis George +2 more
doaj +1 more source
Virtual Network Mapping Algorithm Based on Network Simplex [PDF]
Jisuanji gongcheng, 2019 In the Software Defined Network(SDN) architecture,virtual network mapping is the key technology to achieve network virtualization.To solve the problems of high cost of mapping and long running time,a virtual network mapping algorithm named Simplex-VNM is
WANG Zhizhen,ZHENG Quan,CHEN Chen,TIAN Hongliang
doaj +1 more source
Polynomial dual network simplex algorithms [PDF]
Mathematical Programming, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James B. Orlin +2 more
openaire +4 more sources
New Algorithm Permitting the Construction of an Effective Spanning Tree
Foundations of Computing and Decision Sciences, 2023 In this paper, we have done a rapid and very simple algorithm that resolves the multiple objective combinatorial optimization problem. This, by determining a basic optimal solution, which is a strong spanning tree constructed, according to a well-chosen ...
Belkacem Salima Nait, Abbas Moncef
doaj +1 more source
Genetic Nelder-Mead neural network algorithm for fault parameter inversion using GPS data
Geodesy and Geodynamics, 2022 The traditional genetic algorithm (GA) has unstable inversion results and is easy to fall into the local optimum when inverting fault parameters. Therefore, this article considers the combination of GA with other non-linear algorithms in order to improve
Leyang Wang, Ranran Xu, Fengbin Yu
doaj +1 more source
A Review of Application of Experimental Design Techniques Related to Dark Fermentative Hydrogen Production [PDF]
Journal of Renewable Energy and Environment, 2020 The current review purpose is to present a general overview of different experimental design methods that are applied to investigate the effect of key factors on dark fermentation and are efficient in predicting the experimental data for biological ...
Fatemeh Boshagh, Khosrow Rostami
doaj +1 more source
A parametric visualization software for the assignment problem [PDF]
Yugoslav Journal of Operations Research, 2005 In this paper we present a parametric visualization software used to assist the teaching of the Network Primal Simplex Algorithm for the assignment problem (AP). The assignment problem is a special case of the balanced transportation problem.
Papamanthou Charalampos +2 more
doaj +1 more source