NETWORKS

NETWORKS

NETWORKS
影响因子:1.3
是否综述期刊:
是否预警:不在预警名单内
是否OA:
出版国家/地区:UNITED STATES
出版社:Wiley-Liss Inc.
发刊时间:0
发刊频率:Bimonthly
收录数据库:SCIE/Scopus收录
ISSN:0028-3045

期刊介绍

Network problems are pervasive in our modern technological society, as witnessed by our reliance on physical networks that provide power, communication, and transportation. As well, a number of processes can be modeled using logical networks, as in the scheduling of interdependent tasks, the dating of archaeological artifacts, or the compilation of subroutines comprising a large computer program. Networks provide a common framework for posing and studying problems that often have wider applicability than their originating context.The goal of this journal is to provide a central forum for the distribution of timely information about network problems, their design and mathematical analysis, as well as efficient algorithms for carrying out optimization on networks. The nonstandard modeling of diverse processes using networks and network concepts is also of interest. Consequently, the disciplines that are useful in studying networks are varied, including applied mathematics, operations research, computer science, discrete mathematics, and economics.Networks publishes material on the analytic modeling of problems using networks, the mathematical analysis of network problems, the design of computationally efficient network algorithms, and innovative case studies of successful network applications. We do not typically publish works that fall in the realm of pure graph theory (without significant algorithmic and modeling contributions) or papers that deal with engineering aspects of network design. Since the audience for this journal is then necessarily broad, articles that impact multiple application areas or that creatively use new or existing methodologies are especially appropriate. We seek to publish original, well-written research papers that make a substantive contribution to the knowledge base. In addition, tutorial and survey articles are welcomed. All manuscripts are carefully refereed.
网络问题在我们的现代技术社会中普遍存在,正如我们对提供电力、通信和运输的物理网络的依赖所证明的那样。同样,许多过程可以使用逻辑网络来建模,如在相互依赖的任务的调度、考古文物的年代测定或组成大型计算机程序的子程序的编译中。网络为提出和研究问题提供了一个共同的框架,这些问题往往比它们的起源背景具有更广泛的适用性。本杂志的目标是提供一个中心论坛,及时发布有关网络问题、它们的设计和数学分析以及在网络上进行优化的有效算法的信息。使用网络和网络概念对不同过程进行非标准建模也是令人感兴趣的。因此,对网络研究有用的学科是多种多样的,包括应用数学、运筹学、计算机科学、离散数学和经济学。网络出版了关于使用网络问题的分析建模、网络问题的数学分析、计算效率高的网络算法的设计和成功的网络应用的创新案例研究的材料。我们通常不发表纯图论领域的作品(没有重要的算法和建模贡献)或涉及网络设计工程方面的论文。由于本杂志的读者群必然是广泛的,因此影响多个应用领域或创造性地使用新的或现有方法的文章尤其合适。我们致力于发表原创的、写得很好的研究论文,为知识库做出实质性的贡献。此外,还欢迎提供教程和调查文章。所有手稿都经过仔细审阅。
年发文量 52
国人发稿量 3.93
国人发文占比 0.08%
自引率 -
平均录取率0
平均审稿周期 平均12.0个月
版面费 US$3300
偏重研究方向 工程技术-计算机:硬件
期刊官网 http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0037
投稿链接 http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0037/homepage/ForAuthors.html

期刊高被引文献

Algorithmic results for potential-based flows: Easy and hard cases
来源期刊:NetworksDOI:10.1002/net.21865
Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
来源期刊:NetworksDOI:10.1002/net.21857
A branch-and-price algorithm for the vehicle routing problem with time windows on a road network
来源期刊:NetworksDOI:10.1002/NET.21852
Algorithms and Complexity of Range Clustering
来源期刊:NetworksDOI:10.1002/net.21854
Evaluation of flow dependent external costs in freight logistics networks
来源期刊:NetworksDOI:10.1002/net.21889
Impact of congestion pricing schemes on costs and emissions of commercial fleets in urban areas
来源期刊:NetworksDOI:10.1002/NET.21872
Anticipation versus reactive reoptimization for dynamic vehicle routing with stochastic requests
来源期刊:NetworksDOI:10.1002/net.21861
Distributionally robust project crashing with partial or no correlation information
来源期刊:NetworksDOI:10.1002/NET.21880
An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery
来源期刊:NetworksDOI:10.1002/NET.21879
Complexity of edge coloring with minimum reload/changeover costs
来源期刊:NetworksDOI:10.1002/net.21867
The forwarder planning problem in a two-echelon network
来源期刊:NetworksDOI:10.1002/net.21911
Optimizing ground station networks for free space optical communications: Maximizing the data transfer
来源期刊:NetworksDOI:10.1002/net.21859
来源期刊:DOI:
Bilateral trade with risk-averse intermediary using linear network optimization
来源期刊:NetworksDOI:10.1002/net.21910
Minimum Reload Cost Cycle Cover in Complete Graphs
来源期刊:NetworksDOI:10.1002/NET.21884

质量指标占比

研究类文章占比 OA被引用占比 撤稿占比 出版后修正文章占比
96.15%48.99%--

相关指数

影响因子
影响因子
年发文量
自引率
Cite Score

预警情况

查看说明
时间 预警情况
2025年03月发布的2025版不在预警名单中
2024年02月发布的2024版不在预警名单中
2023年01月发布的2023版不在预警名单中
2021年12月发布的2021版不在预警名单中
2020年12月发布的2020版不在预警名单中
*来源:中科院《 国际期刊预警名单》

JCR分区

WOS分区等级:Q4区
版本 按学科 分区
WOS期刊SCI分区
WOS期刊SCI分区
WOS期刊SCI分区是指SCI官方(Web of Science)为每个学科内的期刊按照IF数值排 序,将期刊按照四等分的方法划分的Q1-Q4等级,Q1代表质量最高,即常说的1区期刊。
(2024-2025年最新版)
COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Q4

中科院分区

查看说明
版本 大类学科 小类学科 Top期刊 综述期刊
2025年3月最新升级版
计算机科学4区
COMPUTER SCIENCE, HARDWARE & ARCHITECTURE 计算机:硬件
4区
OPERATIONS RESEARCH & MANAGEMENT SCIENCE 运筹学与管理科学
4区
2023年12月升级版
计算机科学4区
COMPUTER SCIENCE, HARDWARE & ARCHITECTURE 计算机:硬件
4区
OPERATIONS RESEARCH & MANAGEMENT SCIENCE 运筹学与管理科学
4区
2022年12月旧的升级版
计算机科学4区
COMPUTER SCIENCE, HARDWARE & ARCHITECTURE 计算机:硬件
4区
OPERATIONS RESEARCH & MANAGEMENT SCIENCE 运筹学与管理科学
4区