Networks
短名 | NETWORKS |
Journal Impact | 1.80 |
国际分区 | OPERATIONS RESEARCH & MANAGEMENT SCIENCE(Q3) |
期刊索引 | SCI Q3中科院 4 区 |
ISSN | 0028-3045, 1097-0037 |
h-index | 72 |
国内分区 | 计算机科学(4区)计算机科学计算机硬件(4区)计算机科学运筹学与管理科学(4区) |
网络问题在我们的现代技术社会中普遍存在,正如我们对提供电力、通信和运输的物理网络的依赖所证明的那样。同样,可以使用逻辑网络对许多过程进行建模,例如在相互依赖的任务的调度、考古文物的年代测定或包含大型计算机程序的子程序的编译中。网络为提出和研究问题提供了一个通用框架,这些问题通常比其原始上下文具有更广泛的适用性。本刊的目标是提供一个中心论坛,用于分发有关网络问题、其设计和数学分析的及时信息,以及用于对网络进行优化的有效算法。使用网络和网络概念对不同过程进行非标准建模也很有趣。因此,对研究网络有用的学科是多种多样的,包括应用数学、运筹学、计算机科学、离散数学和经济学。NETWORKS 出版了有关使用网络对问题进行分析建模、网络问题的数学分析、设计计算高效的网络算法,以及成功的网络应用的创新案例研究。我们通常不发表属于纯图论领域的作品(没有重要的算法和建模贡献)或涉及网络设计工程方面的论文。由于该期刊的受众范围必然广泛,因此影响多个应用领域或创造性地使用新方法或现有方法的文章尤其合适。我们力求发表对知识库做出实质性贡献的原创、精心撰写的研究论文。此外,欢迎使用教程和调查文章。所有手稿都经过仔细审阅。
期刊主页投稿网址涉及主题 | 计算机科学数学组合数学工程类数学优化离散数学算法计算机网络理论计算机科学物理程序设计语言图形操作系统人工智能数学分析几何学 |
出版信息 | 出版商: Wiley-Liss Inc.,出版周期: Bimonthly,期刊类型: journal |
基本数据 | 创刊年份: 1971,原创研究文献占比: 100.00%,自引率:6.20%, Gold OA占比: 38.06% |
平均审稿周期 | 网友分享经验:平均12.0个月 |
平均录用比例 | 网友分享经验:容易 |
期刊引文格式
这些示例是对学术期刊文章的引用,以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章,因此这些字段是可选的。有些电子期刊不提供页面范围,而是列出文章标识符。在这种情况下,使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用,以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
Issue Information
2024-9-1
Finding conserved low‐diameter subgraphs in social and biological networks
2024-8-29
A survey on optimization studies of group centrality metrics
2024-8-21
Issue Information
2024-8-1
A dynamic programming algorithm for order picking in robotic mobile fulfillment systems
2024-7-28
A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
2024-7-24
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
2024-7-24
Three network design problems for community energy storage
2024-7-17
Monte Carlo tree search for dynamic shortest‐path interdiction
2024-7-10
Algorithmic solutions for maximizing shareable costs
2024-6-25
Reducing police response times: Optimization and simulation of everyday police patrol
2024-6-23
A real‐life study on the value of integrated optimization in order picking operations under dynamic order arrivals
2024-6-20
A new linear path pair availability constraint for network design
2024-6-19
A practical and robust approach for solving the multi‐compartment vehicle routing problem under demand uncertainty using machine learning
2024-6-14
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis
2024-6-11
Getting linear time in graphs of bounded neighborhood diversity
2024-6-7
A cops and robber game and the meeting time of synchronous directed walks
2024-6-5
Issue Information
2024-6-1
A robust optimization framework for two‐echelon vehicle and UAV routing for post‐disaster humanitarian logistics operations
2024-5-30
A warehouse location‐allocation bilevel problem that considers inventory policies
2024-5-30
Network design with vulnerability constraints and probabilistic edge reliability
2024-4-27
A flow‐based ascending auction to compute buyer‐optimal Walrasian prices
2024-4-16
Issue Information
2024-4-15
Selectively closing recycling centers in Bavaria: Reforming waste‐management policy to reduce disparity
2024-4-15
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
2024-4-15
Maximum flow‐based formulation for the optimal location of electric vehicle charging stations
2024-4-11
Collaborative transportation for attended home deliveries
2024-3-28
Heuristic reoptimization of time‐extended multi‐robot task allocation problems
2024-3-12
New approximations for network reliability
2024-3-4
Issue Information
2024-3-1
Enhanced methods for the weight constrained shortest path problem
2024-2-13
Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters
2024-2-13
An improved hybrid genetic search with data mining for the CVRP
2024-2-8
Virtual network function reconfiguration in 5G networks: An optimization perspective
2024-2-8
Issue Information
2024-2-7
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines
2024-1-23
Algorithms and complexity for the almost equal maximum flow problem
2024-1-23
On the complexity of the upgrading version of the maximal covering location problem
2024-1-17
Shortest path network interdiction with asymmetric uncertainty
2024-1-15
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
2024-1-11
How vulnerable is an undirected planar graph with respect to max flow
2024-1-3
Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
2023-12-26
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
2023-12-20
帮你贴心管理全部的文献
研飞ivySCI,高效的论文管理
投稿经验分享
分享我的经验,帮你走得更远