咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是41-50 订阅
排序:
Constrained quantization
收藏 引用
SIGNAL PROCESSING 2003年 第9期83卷 1839-1858页
作者: Kämpke, T FAW D-89081 Ulm Germany
Discrete functions over a continuous domain are approximated by discrete functions with fewer levels. These quantizations are endowed with different types of constraints such as monotonicity and variational constraint... 详细信息
来源: 评论
The fastest itinerary in time-dependent decentralized travel information systems
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2006年 第3期12卷 167-185页
作者: Wang, Jinchang Kaempke, Thomas Richard Stockton Coll New Jersey Pomona NJ 08232 USA Res Inst Appl Knowledge Proc N D-89081 Ulm Germany
A travel information system (TIS) provides customers with information about transportation, transfers, and routings. A decentralized TIS is composed of autonomous subsystems and a central computer, where local subsyst... 详细信息
来源: 评论
An efficient algorithm for automatic classification and centromere detection in G-band human chromosome image using band distance feature
收藏 引用
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2021年 第6期40卷 11463-11474页
作者: Kumar, P. Saravana Vasuki, S. Kalasalingam Inst Technol Dept ECE Krishnankoil Tamil Nadu India Velammal Coll Engn & Technol Dept ECE Viraganur Tamil Nadu India
In chromosome analysis, centromere is an essential component. By analyzing centromere, genetic disorder can be identified easily. In this paper, automatic classification and centromere detection in human chromosome im... 详细信息
来源: 评论
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... 详细信息
来源: 评论
The Migratory Beekeeping Routing Problem: Model and an Exact algorithm
收藏 引用
INFORMS JOURNAL ON COMPUTING 2021年 第1期33卷 319-335页
作者: Ma, Zu-Jun Yang, Fei Dai, Ying Shen, Zuo-Jun Max Southwest Jiaotong Univ Sch Econ & Management Chengdu 610031 Peoples R China Univ Calif Berkeley Dept Ind Engn & Operat Res Berkeley CA 94720 USA Univ Calif Berkeley Dept Civil & Environm Engn Berkeley CA 94720 USA
Apiculture has gained worldwide interest because of its contributions to economic incomes and environmental conservation. In view of these, migratory beekeeping, as a high-yielding technique, is extensively adopted. H... 详细信息
来源: 评论
Determining Type II sensitivity ranges of the fractional assignment problem
收藏 引用
OPERATIONS RESEARCH LETTERS 2011年 第1期39卷 67-73页
作者: Lin, Chi-Jen Ta Hwa Inst Technol Dept Ind Engn & Management Cyong Lin 307 Hsin Chu County Taiwan
This paper proposes iterative labeling algorithms to determine the Type II sensitivity ranges of the fractional assignment problem. Unlike the traditional sensitivity range which keeps the current optimal basis remain... 详细信息
来源: 评论
Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs
收藏 引用
TRANSPORTATION SCIENCE 2019年 第5期53卷 1409-1426页
作者: He, Qie Irnich, Stefan Song, Yongjia Univ Minnesota Dept Ind & Syst Engn Minneapolis MN 55455 USA Johannes Gutenberg Univ Mainz Gutenberg Sch Management & Econ D-55128 Mainz Germany Clemson Univ Dept Ind Engn Clemson SC 29634 USA
Two critical yet frequently conflicting objectives for logistics and transportation service companies are improving customer satisfaction and reducing transportation cost. In particular, given a network of customer re... 详细信息
来源: 评论
Type II sensitivity analysis of cost coefficients in the degenerate transportation problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2013年 第2期227卷 293-300页
作者: Ma, Kang-Ting Lin, Chi-Jen Wen, Ue-Pyng Natl Tsing Hua Univ Dept Ind Engn & Engn Management Hsinchu Taiwan Ta Hua Univ Sci & Technol Dept Ind Engn & Management Hsinchu Taiwan
This paper focuses on sensitivity analysis of the degenerate transportation problem (DTP) when perturbation occurs on one cost coefficient. The conventional Type I sensitivity analysis of the transportation problem (T... 详细信息
来源: 评论
Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut algorithms on Path-Based Models
收藏 引用
TRANSPORTATION SCIENCE 2020年 第5期54卷 1170-1188页
作者: Desaulniers, Guy Gschwind, Timo Irnich, Stefan Polytech Montreal GERAD Montreal PQ H3T 1J4 Canada Polytech Montreal Dept Math & Ind Engn Montreal PQ H3T 1J4 Canada Johannes Gutenberg Univ Mainz Gutenberg Sch Management & Econ D-55128 Mainz Germany
Variable fixing by reduced costs is a popular technique for accelerating the solution process of mixed-integer linear programs. For vehicle-routing problems solved by branch-price-and-cut algorithms, it is possible to... 详细信息
来源: 评论
Optimizing flow rates in a queueing network with side constraints
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1996年 第3期88卷 586-591页
作者: Pourbabai, B Blanc, JPC Schouten, FAV TILBURG UNIV DEPT ECONOMETR5000 LE TILBURGNETHERLANDS UNIV MARYLAND DEPT MECH ENGNCOLLEGE PKMD 20742
In this paper, modified versions of the classical deterministic maximum flow and minimum cost network flow problems are presented in a stochastic queueing environment. In the maximum flow network model, the throughput... 详细信息
来源: 评论