咨询与建议

限定检索结果

文献类型

  • 58 篇 期刊文献
  • 8 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 54 篇 工学
    • 34 篇 计算机科学与技术...
    • 11 篇 电气工程
    • 10 篇 交通运输工程
    • 5 篇 土木工程
    • 4 篇 信息与通信工程
    • 4 篇 软件工程
    • 2 篇 电子科学与技术(可...
    • 1 篇 力学(可授工学、理...
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 测绘科学与技术
    • 1 篇 生物医学工程(可授...
  • 35 篇 管理学
    • 35 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 16 篇 理学
    • 15 篇 数学
    • 1 篇 化学
    • 1 篇 生物学
  • 7 篇 经济学
    • 5 篇 理论经济学
    • 2 篇 应用经济学
  • 3 篇 医学
    • 3 篇 临床医学
  • 1 篇 文学
    • 1 篇 外国语言文学

主题

  • 66 篇 labeling algorit...
  • 8 篇 connected compon...
  • 8 篇 vehicle routing
  • 7 篇 pattern recognit...
  • 7 篇 column generatio...
  • 6 篇 connected compon...
  • 5 篇 label equivalenc...
  • 4 篇 sensitivity anal...
  • 4 篇 degeneracy
  • 4 篇 branch-and-price
  • 3 篇 routing
  • 3 篇 assignment probl...
  • 3 篇 linear-time algo...
  • 3 篇 shortest path pr...
  • 3 篇 run-length encod...
  • 3 篇 vehicle routing ...
  • 2 篇 electric vehicle...
  • 2 篇 first scan
  • 2 篇 branch-and-cut-a...
  • 2 篇 raster scan

机构

  • 5 篇 nagoya sangyo un...
  • 4 篇 aichi prefectura...
  • 4 篇 univ chicago div...
  • 3 篇 univ chicago dep...
  • 3 篇 johannes gutenbe...
  • 2 篇 ta hwa inst tech...
  • 2 篇 clemson univ dep...
  • 2 篇 kyoto univ dept ...
  • 2 篇 natl tsing hua u...
  • 1 篇 icd-losi univers...
  • 1 篇 princeton univ d...
  • 1 篇 inria bordeaux s...
  • 1 篇 tsinghua univ de...
  • 1 篇 shenyang univ te...
  • 1 篇 osaka univ grad ...
  • 1 篇 aoyama gakuin un...
  • 1 篇 daifuku co ltd s...
  • 1 篇 univ tours lab f...
  • 1 篇 univ paris sacla...
  • 1 篇 beijing jiaotong...

作者

  • 9 篇 he lifeng
  • 9 篇 chao yuyan
  • 8 篇 suzuki kenji
  • 4 篇 gschwind timo
  • 4 篇 irnich stefan
  • 4 篇 lin chi-jen
  • 3 篇 desaulniers guy
  • 3 篇 froger aurelien
  • 3 篇 murakami keisuke
  • 2 篇 hisano takeshi
  • 2 篇 song yongjia
  • 2 篇 qureshi ali gul
  • 2 篇 nishi tatsushi
  • 2 篇 matsushita susum...
  • 2 篇 mendoza jorge e.
  • 2 篇 taniguchi eiichi
  • 2 篇 sadykov ruslan
  • 2 篇 wen ue-pyng
  • 1 篇 qi mingyao
  • 1 篇 yang fei

语言

  • 64 篇 英文
  • 2 篇 其他
检索条件"主题词=Labeling algorithm"
66 条 记 录,以下是1-10 订阅
排序:
An Efficient Connected-Component labeling algorithm for 3-D Binary Images
IEEE OPEN JOURNAL OF THE COMPUTER SOCIETY
收藏 引用
IEEE OPEN JOURNAL OF THE COMPUTER SOCIETY 2023年 第1期4卷 1-12页
作者: Zhao, Xiao Chao, Yuyan Zhang, Hui Yao, Bin He, Lifeng Shaanxi Univ Sci & Technol Artificial Intelligence Inst Sch Elect Informat & Artificial Intelligence Xian 710021 Peoples R China Nagoya Sangyo Univ Grad Sch Environm Management Owariasa Shi 4888711 Japan Aichi Prefectural Univ Grad Sch Informat Sci & Technol Nagakute 4801198 Japan
Conventional voxel-based algorithms for labeling connected components in 3D binary images use the same mask to process all object voxels. To reduce the number of times that neighboring voxels are checked when object v... 详细信息
来源: 评论
A Bucket Graph-Based labeling algorithm with Application to Vehicle Routing
收藏 引用
TRANSPORTATION SCIENCE 2021年 第1期55卷 4-28页
作者: Sadykov, Ruslan Uchoa, Eduardo Pessoa, Artur INRIA Bordeaux Sud Ouest F-33405 Talence France Univ Bordeaux Inst Math F-3340 Talence France Univ Fed Fluminense Engn Prod BR-24210240 Niteroi RJ Brazil
We consider the shortest path problem with resource constraints arising as a subproblem in state-of-the-art branch-cut-and-price algorithms for vehicle routing problems. We propose a variant of the bidirectional label... 详细信息
来源: 评论
Block-Based Connected-Component labeling algorithm Using Binary Decision Trees
收藏 引用
SENSORS 2015年 第9期15卷 23763-23787页
作者: Chang, Wan-Yu Chiu, Chung-Cheng Yang, Jia-Horng Natl Def Univ Chung Cheng Inst Technol Dept Elect & Elect Engn Taoyuan 33551 Taoyuan County Taiwan
In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed a... 详细信息
来源: 评论
An exact branch-and-price-and-cut algorithm for a practical and large-scale dial-a-ride problem
收藏 引用
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2025年 第6期76卷 1125-1139页
作者: Karimi, Mohammad Camiat, Fanny Desaulniers, Guy Gendreau, Michel Polytech Montreal Montreal PQ Canada CIRRELT Montreal PQ Canada GIRO Inc Montreal PQ Canada GERAD Montreal PQ Canada
Vehicle routing problems are encountered in various practical transportation scenarios. One such problem is the dial-a-ride problem (DARP), which involves transporting efficiently passengers from their origin to their... 详细信息
来源: 评论
Optimizing the Transport of Organs for Transplantation
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2025年 176卷
作者: Balster, Isaac Caetano, Joyce Azevedo Ribeiro, Glaydston Mattos Bahiense, Laura Fed Univ Rio Janeiro Alberto Luiz Coimbra Inst Grad Studies & Res Engn Transport Engn Program Rio De Janeiro Brazil Fed Univ Rio Janeiro Alberto Luiz Coimbra Inst Grad Studies & Res Engn Syst Engn & Comp Sci Program Transport Engn Program Rio De Janeiro Brazil
As an organ becomes available for transplantation, a recipient must be selected. Usually, donor and recipient are geographically apart. Therefore, the transport of the organ must be planned and executed within the tim... 详细信息
来源: 评论
Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
收藏 引用
OR SPECTRUM 2024年 第4期46卷 1063-1097页
作者: Faldum, Stefan Machate, Sarah Gschwind, Timo Irnich, Stefan Johannes Gutenberg Univ Mainz Chair Logist Management Gutenberg Sch Management & Econ Jakob Welder Weg 9 D-55128 Mainz Germany RPTU Kaiserlautern Landau Chair Logist Sch Business & Econ Gottlieb Daimler Str 42 D-67663 Kaiserslautern Germany
For many variants of vehicle routing and scheduling problems solved by a branch-price-and-cut (BPC) algorithm, the pricing subproblem is an elementary shortest-path problem with resource constraints (SPPRC) typically ... 详细信息
来源: 评论
New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023年 第1期306卷 65-82页
作者: Froger, Aurelien Sadykov, Ruslan Univ Bordeaux UMR CNRS 5251 F-33405 Talence France Ctr Inria Univ Bordeaux F-33405 Talence France
We study the prize-collecting job sequencing problem with one common and multiple secondary re-sources. In this problem, a set of jobs is given, each with a profit, multiple time windows for its exe-cution, and a dura... 详细信息
来源: 评论
A branch-and-price approach for airport gate assignment problem with chance constraints
收藏 引用
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2023年 第1期168卷 1-26页
作者: Kim, Junyoung Goo, Byungju Roh, Youngjoo Lee, Chungmok Lee, Kyungsik Seoul Natl Univ Dept Ind Engn Seoul South Korea Hankuk Univ Foreign Studies Dept Ind & Management Engn Seoul South Korea
At an airport, the flights should be attached to the gates to embark or disembark the passengers. The airport gate assignment problem concerns the efficient utilization of gates by assigning flights to the gates accor... 详细信息
来源: 评论
A branch-and-price algorithm for two-echelon electric vehicle routing problem
收藏 引用
COMPLEX & INTELLIGENT SYSTEMS 2023年 第3期9卷 2475-2490页
作者: Wu, Zhiguo Zhang, Juliang Beijing Jiaotong Univ Sch Econ & Management Beijing Peoples R China
Motivated by express and e-commerce companies' distribution practices, we study a two-echelon electric vehicle routing problem. In this problem, fuel-powered vehicles are used to transport goods from a depot to in... 详细信息
来源: 评论
A multi-vehicle covering tour problem with speed optimization
收藏 引用
NETWORKS 2022年 第2期79卷 119-142页
作者: Margolis, Joshua T. Song, Yongjia Mason, Scott J. Clemson Univ Dept Ind Engn Clemson SC 29634 USA
A multi-vehicle covering tour problem with speed optimization, we aim to construct a set of maximal coverage routes for a fleet of vehicles that serve (observe) a set of secondary sites, given a fixed time schedule an... 详细信息
来源: 评论