Simplifying obstacles for Steiner network problems in the plane

Networks ◽  
2021 ◽  
Author(s):  
Marcus Volz ◽  
Marcus Brazil ◽  
Charl Ras ◽  
Doreen Thomas
Keyword(s):  
Network Problems

On random walks in direction-aware network problems

2010 ◽  
Vol 38 (2) ◽  
pp. 9-11 ◽  
Author(s):  
Ali Tizghadam ◽  
Alberto Leon-Garcia
Keyword(s):  
Random Walks ◽  
Network Problems

An extreme‐point tabu‐search algorithm for fixed‐charge network problems

Networks ◽  
2021 ◽  
Vol 77 (2) ◽  
pp. 322-340 ◽  
Author(s):  
Richard S. Barr ◽  
Fred Glover ◽  
Toby Huskinson ◽  
Gary Kochenberger
Keyword(s):  
Tabu Search ◽  
Extreme Point ◽  
Search Algorithm ◽  
Fixed Charge ◽  
Tabu Search Algorithm ◽  
Network Problems

scholarly journals Identifying and localizing network problems using the PuNDIT project

2015 ◽  
Vol 664 (5) ◽  
pp. 052027 ◽  
Author(s):  
Jorge Batista ◽  
Constantine Dovrolis ◽  
Danny Lee ◽  
Shawn McKee
Keyword(s):  
Network Problems

Strategies for Solving Large Location-Allocation Problems by Heuristic Methods

1992 ◽  
Vol 24 (2) ◽  
pp. 289-304 ◽  
Author(s):  
P J Densham ◽  
G Rushton
Keyword(s):  
Spatial Structure ◽  
Heuristic Methods ◽  
Problem Size ◽  
Interpoint Distance ◽  
Allocation Algorithm ◽  
Complexity Of Algorithms ◽  
Location Allocation ◽  
Network Problems ◽  
Allocation Problems ◽  
Distance Data

Solution techniques for location-allocation problems usually are not a part of microcomputer-based geoprocessing systems because of the large volumes of data to process and store and the complexity of algorithms. In this paper, it is shown that processing costs for the most accurate, heuristic, location-allocation algorithm can be drastically reduced by exploiting the spatial structure of location-allocation problems. The strategies used, preprocessing interpoint distance data as both candidate and demand strings, and use of them to update an allocation table, allow the solution of large problems (3000 nodes) in a microcomputer-based, interactive decisionmaking environment. Moreover, these strategies yield solution times which increase approximately linearly with problem size. Tests on four network problems validate these claims.

scholarly journals Efficient Algorithms for Identifying Loop Formation and Computing θ Value for Solving Minimum Cost Flow Network Problems

2021 ◽  
Vol 20 ◽  
pp. 107-117
Author(s):  
TIMOTHY MICHAEL CHÁVEZ ◽  
DUC THAI NGUYEN
Keyword(s):  
Real Life ◽  
Minimum Cost ◽  
Simplex Algorithm ◽  
Efficient Algorithms ◽  
Computer Implementation ◽  
Loop Formation ◽  
Minimum Cost Flow ◽  
Flow Network ◽  
Network Problems ◽  
Cost Flow

While the minimum cost flow (MCF) problems have been well documented in many publications, due to its broad applications, little or no effort have been devoted to explaining the algorithms for identifying loop formation and computing the θ value needed to solve MCF network problems. This paper proposes efficient algorithms, and MATLAB computer implementation, for solving MCF problems. Several academic and real-life network problems have been solved to validate the proposed algorithms; the numerical results obtained by the developed MCF code have been compared and matched with the built-in MATLAB function Linprog() (Simplex algorithm) for further validation.

scholarly journals The reality of the use of postgraduate students in the Faculty of Education Damascus University for E- mail in education

2019 ◽  
Vol 3 (6) ◽  
Author(s):  
Nasreen Abdel - Ilah Zahra
Keyword(s):  
Standard Deviation ◽  
Faculty Members ◽  
University Education ◽  
The Internet ◽  
Postgraduate Students ◽  
Network Problems ◽  
Email Address ◽  
Faculty Of Education ◽  
E Mail ◽  
Descriptive Method

The study was used to study the reality of the use of postgraduate students for e- mail. The descriptive descriptive method was used. The questionnaire was used as a tool for study، which averaged 1.99 and a standard deviation of 0.61. It was applied to 45 students from post- Different The results showed that postgraduate students have a desire to use e- mail in university education and to communicate with colleagues and faculty members. However، there are obstacles to their use. The faculty members do not encourage students to use e- mail، lack e- mail skills، Access to the internet laboratory at the college، the reluctance of faculty members to give their email address to students، network problems (slow) In the light of the results، a set of recommendations and proposals were presented to activate the use of e- mail in university education، especially among postgraduate students in the Faculty of Education and various Syrian and Arab universities

Sign in / Sign up

Export Citation Format

Share Document