咨询与建议

限定检索结果

文献类型

  • 23 篇 期刊文献
  • 3 篇 会议

馆藏范围

  • 26 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 15 篇 工学
    • 10 篇 计算机科学与技术...
    • 6 篇 电气工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 信息与通信工程
    • 1 篇 控制科学与工程
    • 1 篇 软件工程
  • 13 篇 理学
    • 10 篇 数学
    • 4 篇 物理学
  • 7 篇 管理学
    • 7 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 1 篇 经济学
    • 1 篇 理论经济学
    • 1 篇 应用经济学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 26 篇 graph partitioni...
  • 4 篇 copositive progr...
  • 4 篇 local search
  • 3 篇 genetic algorith...
  • 2 篇 shaking term
  • 2 篇 np hard
  • 2 篇 assignment probl...
  • 2 篇 semidefinite rel...
  • 2 篇 clustering probl...
  • 2 篇 fm method
  • 2 篇 graph theory
  • 2 篇 operating equati...
  • 2 篇 genetic algorith...
  • 2 篇 neural network
  • 2 篇 simulated anneal...
  • 2 篇 kl method
  • 2 篇 semidefinite pro...
  • 1 篇 eye
  • 1 篇 parallel algorit...
  • 1 篇 traveling salesm...

机构

  • 1 篇 univ teknol petr...
  • 1 篇 inst math phys &...
  • 1 篇 univ fukui fac e...
  • 1 篇 department of ma...
  • 1 篇 duke univ dept p...
  • 1 篇 department of in...
  • 1 篇 dept. of info. a...
  • 1 篇 natl chiao tung ...
  • 1 篇 otaru univ comme...
  • 1 篇 shanghai jiao to...
  • 1 篇 russian acad sci...
  • 1 篇 inst math phys &...
  • 1 篇 konrad-zuse-zent...
  • 1 篇 inst math phys &...
  • 1 篇 max planck inst ...
  • 1 篇 novosibirsk stat...
  • 1 篇 natl univ singap...
  • 1 篇 orange labs caen
  • 1 篇 nankai univ ctr ...
  • 1 篇 florida int univ...

作者

  • 4 篇 povh janez
  • 1 篇 zhang yikang
  • 1 篇 lozano jose a.
  • 1 篇 küçüpetek s
  • 1 篇 a. mikhailova
  • 1 篇 oguztüzün h
  • 1 篇 pesch erwin
  • 1 篇 kaji t
  • 1 篇 rais helmi md
  • 1 篇 ouyang dantong
  • 1 篇 grötschel martin
  • 1 篇 krispenz ludwig
  • 1 篇 chen william y. ...
  • 1 篇 chen zhi-qiang
  • 1 篇 nishikawa seishi
  • 1 篇 giroudeau rodolp...
  • 1 篇 abed saad adnan
  • 1 篇 tian xinliang
  • 1 篇 ceberio josu
  • 1 篇 chen k

语言

  • 24 篇 英文
  • 2 篇 其他
检索条件"主题词=Graph Partitioning Problem"
26 条 记 录,以下是1-10 订阅
排序:
Computational Comparison of Major Proposed Methods for graph partitioning problem
收藏 引用
JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS 2019年 第1期23卷 5-17页
作者: Rais, Helmi Md Abed, Saad Adnan Watada, Junzo Univ Teknol Petronas Dept Comp & Informat Sci Seri Iskandar 32610 Perak Malaysia Univ Teknol Petronas High Performance Cloud Comp Ctr Seri Iskandar 32610 Perak Malaysia
k-way graph partitioning is an NP-complete problem, which is applied to various tasks such as route planning, image segmentation, community detection, and high-performance computing. The approximate methods constitute... 详细信息
来源: 评论
On the sum-max graph partitioning problem
收藏 引用
THEORETICAL COMPUTER SCIENCE 2014年 第1期540卷 143-155页
作者: Watrigant, Remi Bougeret, Marin Giroudeau, Rodolphe Koenig, Jean-Claude LIRMM Univ Montpellier II CNRS UMR 5506 F-34392 Montpellier 5 France
This paper tackles the following problem: given a connected graph G = (V E) with a weight function on its edges and an integer k <= vertical bar V vertical bar, find a partition of V into k clusters such that the s... 详细信息
来源: 评论
Contribution of copositive formulations to the graph partitioning problem
收藏 引用
OPTIMIZATION 2013年 第1期62卷 71-83页
作者: Povh, Janez Inst Math Phys & Mech Ljubljana 1000 Slovenia Fac Informat Studies Novo Mesto 8000 Slovenia
This article provides analysis of several copositive formulations of the graph partitioning problem and semidefinite relaxations based on them. We prove that the copositive formulations based on results from Burer [S.... 详细信息
来源: 评论
DSLS: a simple and efficient local search algorithm for the maximum bisection problem
收藏 引用
JOURNAL OF HEURISTICS 2024年 第1-2期30卷 43-65页
作者: Tian, Xinliang Ouyang, Dantong Zhou, Huisi Sun, Rui Zhang, Liming Jilin Univ Coll Comp Sci & Technol Changchun 130012 Peoples R China Jilin Univ Key Lab Symbol Computat & Knowledge Engn Minist Educ Changchun 130012 Peoples R China
The maximum bisection problem (max-bisection) belongs to a family of well-known graph partitioning problems with wide applications. In this study, we develop a simple and efficient local search algorithm called DSLS f... 详细信息
来源: 评论
Genetic local search the graph partitioning problem under cardinality constraints
收藏 引用
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2012年 第1期52卷 157-167页
作者: Kochetov, Yu. A. Plyasunov, A. V. Russian Acad Sci Siberian Branch Sobolev Inst Math Novosibirsk 630090 Russia
For the graph partitioning problem under cardinality constraints, a genetic local search method is developed. At each iteration of the method, there is a set of local optima of the problem. This set is used to search ... 详细信息
来源: 评论
Optimized Lie-Trotter-Suzuki decompositions for two and three non-commuting terms
收藏 引用
ANNALS OF PHYSICS 2020年 418卷 168165-168165页
作者: Barthel, Thomas Zhang, Yikang Duke Univ Dept Phys Durham NC 27708 USA
Lie-Trotter-Suzuki decompositions are an efficient way to approximate operator exponentials exp(tH) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in tim... 详细信息
来源: 评论
Automatic choroid layer segmentation using normalized graph cut
收藏 引用
IET IMAGE PROCESSING 2018年 第1期12卷 53-59页
作者: Masood, Saleha Sheng, Bin Li, Ping Shen, Ruimin Fang, Ruogu Wu, Qiang Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China Macau Univ Sci & Technol Fac Informat Technol Macau Peoples R China Florida Int Univ Sch Comp & Informat Sci Miami FL 33199 USA Shanghai Jiao Tong Univ Affiliated Peoples Hosp 6 Shanghai Peoples R China
Optical coherence tomography is an immersive technique for depth analysis of retinal layers. Automatic choroid layer segmentation is a challenging task because of the low contrast inputs. Existing methodologies carrie... 详细信息
来源: 评论
Solving the m-Way graph partitioning problem Using a Genetic Algorithm
收藏 引用
IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING 2011年 第5期6卷 483-489页
作者: Chen, Zhi-Qiang Wang, Rong-Long Univ Fukui Fac Engn Dept Elect & Elect Engn Fukui 910 Japan
The m-way graph partitioning problem is of central importance in combinatorial optimization. It has many important applications in fields such as VLSI circuit design, task allocation in distributed computing systems, ... 详细信息
来源: 评论
Distance-Based Exponential Probability Models for Constrained Combinatorial problems  18th
Distance-Based Exponential Probability Models for Constraine...
收藏 引用
18th Conference of the Spanish-Association-for-Artificial-Intelligence (CAEPIA)
作者: Ceberio, Josu Mendiburu, Alexander Lozano, Jose A. Univ Basque Country UPV EHU Paseo Manuel Lardizabal 1 Donostia San Sebastian 20018 Spain BCAM Alameda Mazarredo 14 Bilbao 48009 Spain
Estimation of Distribution Algorithms (EDAs) have already demonstrated their utility when solving a broad range of combinatorial problems. However, there is still room for methodological improvement when approaching p... 详细信息
来源: 评论
Operation of shunting yards: train-to-yard assignment problem
收藏 引用
Journal of Business Economics 2017年 第4期87卷 465-486页
作者: Otto, Alena Pesch, Erwin Department of Management Information Science University of Siegen Kohlbettstraße 15 Siegen 57068 Germany Center of Advanced Studies in Management HHL Leipzig Jahnallee 59 Leipzig 04109 Germany
A multiple shunting yard as a major freight rail yard consists of several sub-yards of limited capacities. Our research question is how to assign the railcars of inbound trains among the sub-yards such that the number... 详细信息
来源: 评论