咨询与建议

限定检索结果

文献类型

  • 296 篇 期刊文献
  • 55 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 232 篇 工学
    • 179 篇 计算机科学与技术...
    • 32 篇 电气工程
    • 20 篇 软件工程
    • 15 篇 机械工程
    • 15 篇 信息与通信工程
    • 12 篇 生物工程
    • 10 篇 控制科学与工程
    • 9 篇 交通运输工程
    • 8 篇 电子科学与技术(可...
    • 5 篇 土木工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 光学工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 农业工程
  • 169 篇 理学
    • 143 篇 数学
    • 16 篇 生物学
    • 12 篇 统计学(可授理学、...
    • 4 篇 物理学
    • 3 篇 化学
    • 1 篇 系统科学
  • 138 篇 管理学
    • 137 篇 管理科学与工程(可...
    • 20 篇 工商管理
  • 28 篇 经济学
    • 23 篇 应用经济学
    • 5 篇 理论经济学
  • 11 篇 医学
  • 3 篇 法学
    • 2 篇 社会学
    • 1 篇 法学
  • 2 篇 教育学
    • 2 篇 心理学(可授教育学...
  • 2 篇 农学
  • 1 篇 军事学

主题

  • 353 篇 exact algorithm
  • 21 篇 dynamic programm...
  • 12 篇 combinatorial op...
  • 11 篇 approximation al...
  • 10 篇 fixed-parameter ...
  • 9 篇 computational ge...
  • 9 篇 heuristics
  • 9 篇 branch-and-bound
  • 8 篇 optimization
  • 8 篇 scheduling
  • 7 篇 np-hard problem
  • 7 篇 approximate algo...
  • 7 篇 heuristic
  • 7 篇 shortest path
  • 7 篇 satisfiability
  • 7 篇 complexity
  • 7 篇 knapsack problem
  • 6 篇 routing
  • 6 篇 np-hard
  • 6 篇 independent set

机构

  • 9 篇 kyonggi univ dep...
  • 8 篇 univ elect sci &...
  • 5 篇 sobolev inst mat...
  • 5 篇 nanjing univ sch...
  • 5 篇 dongbei univ fin...
  • 4 篇 natl univ singap...
  • 4 篇 northeastern uni...
  • 4 篇 univ laval canad...
  • 4 篇 kyoto univ dept ...
  • 4 篇 univ cologne ins...
  • 3 篇 univ alberta dep...
  • 3 篇 kyoto univ grad ...
  • 3 篇 texas a&m univ d...
  • 3 篇 univ laval cirre...
  • 3 篇 univ jena inst i...
  • 3 篇 novosibirsk stat...
  • 3 篇 postech dept com...
  • 3 篇 cent south univ ...
  • 3 篇 kobe univ grad s...
  • 3 篇 kyonggi univ div...

作者

  • 12 篇 bae sang won
  • 7 篇 yu yang
  • 7 篇 xiao mingyu
  • 6 篇 coelho leandro c...
  • 6 篇 tang jiafu
  • 6 篇 saurabh saket
  • 5 篇 okamoto yoshio
  • 5 篇 tanaka shunji
  • 4 篇 laporte gilbert
  • 4 篇 lim andrew
  • 4 篇 yamaguchi kazuak...
  • 4 篇 masuda sumio
  • 4 篇 sun wei
  • 4 篇 nagamochi hirosh...
  • 4 篇 rajasekaran sang...
  • 4 篇 lin guohui
  • 4 篇 seto kazuhisa
  • 4 篇 niedermeier rolf
  • 4 篇 wang junwei
  • 4 篇 wei lijun

语言

  • 312 篇 英文
  • 39 篇 其他
  • 1 篇 中文
检索条件"主题词=exact algorithm"
353 条 记 录,以下是71-80 订阅
排序:
Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2025年 173卷
作者: Wang, Sunkanghong Yao, Shaowen Zhang, Hao Liu, Qiang Wei, Lijun Guangdong Univ Technol Guangdong Prov Key Lab Comp Integrated Mfg Syst State Key Lab Precis Elect Mfg Technol & Equipment Guangzhou 510006 Peoples R China
This study introduces an arc-flow formulation and the first branch-and-price-and-cut (BPC) algorithm designed to solve the bin-packing problem with fragile objects (BPPFO). This variant of the bin-packing problem orig... 详细信息
来源: 评论
Dynamic Optimization of Tunnel Construction Scheduling in a Reverse Construction Scenario
收藏 引用
SYSTEMS 2025年 第3期13卷 168-168页
作者: Wei, Jianying Liu, Yuming Lu, Xiaochun Zhao, Rong Wang, Gan Beijing Jiaotong Univ Sch Econ & Management Beijing 100044 Peoples R China China Acad Bldg Res Beijing 100013 Peoples R China
Tunnel construction, a critical aspect of railway engineering, is a repetitive process with distinct linear characteristics. While the Linear Scheduling Method (LSM) is widely used for scheduling optimization in linea... 详细信息
来源: 评论
exact algorithms for the multiple depot vehicle scheduling problem with heterogeneous vehicles, split loads and toll-by-weight scheme
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2022年 168卷
作者: Li, Jiliu Qin, Hu Shen, Huaxiao Tong, Xialiang Xu, Zhou Sun Yat sen Univ Sch Business Guangzhou 510275 Peoples R China Huazhong Univ Sci & Technol Sch Management Wuhan 430074 Peoples R China Huawei Noahs Ark Lab Hong Kong Peoples R China Hong Kong Polytech Univ Fac Business Hong Kong Peoples R China
We study a general version of the multiple depot vehicle scheduling problem, which is motivated by the practice of line-haul transportation in Chinese express delivery firms. In this problem, there are a set of trips ... 详细信息
来源: 评论
exact algorithms for finding minimum transversals in rank-3 hypergraphs
收藏 引用
JOURNAL OF algorithmS-COGNITION INFORMATICS AND LOGIC 2004年 第2期51卷 107-121页
作者: Wahlström, M Linkoping Univ Dept Comp & Informat Sci TCSLab Linkoping Sweden
We present two algorithms for the problem of finding a minimum transversal in a hypergraph of rank 3, also known as the 3-Hitting Set problem. This problem is a natural extension of the vertex cover problem for ordina... 详细信息
来源: 评论
exact algorithms for the Hamiltonian cycle problem in planar graphs
收藏 引用
OPERATIONS RESEARCH LETTERS 2006年 第3期34卷 269-274页
作者: Deineko, VG Klinz, B Woeginger, GJ Graz Univ Technol Inst Math B A-8010 Graz Austria Univ Warwick Sch Business Coventry CV4 7AL W Midlands England Tech Univ Eindhoven Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands
We construct an exact algorithm for the Hamiltonian cycle problem in planar graphs with worst case time complexity O(c(root n)), where c is some fixed constant that does not depend on the instance. Furthermore, we sho... 详细信息
来源: 评论
exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
收藏 引用
THEORETICAL COMPUTER SCIENCE 2017年 第PartA期657卷 86-97页
作者: Xiao, Mingyu Kou, Shaowei Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China
A dissociation set in a graph G = (V, E) is a vertex subset D such that the subgraph G[D] induced on D has vertex degree at most 1. A 3-path vertex cover in a graph is a vertex subset C such that every path of three v... 详细信息
来源: 评论
exact algorithms for the two-dimensional guillotine knapsack
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2012年 第1期39卷 48-53页
作者: Dolatabadi, Mohammad Lodi, Andrea Monaci, Michele Univ Bologna DEIS I-40136 Bologna Italy Univ Ferdowsi Fac Math & Stat Mashhad Iran Univ Padua DEI I-35131 Padua Italy
The two-dimensional knapsack problem requires to pack a maximum profit subset of "small" rectangular items into a unique "large" rectangular sheet. Packing must be orthogonal without rotation, i.e.... 详细信息
来源: 评论
exact algorithms for the Bottleneck Steiner Tree Problem
收藏 引用
algorithmICA 2011年 第4期61卷 924-948页
作者: Bae, Sang Won Choi, Sunghee Lee, Chunseok Tanigawa, Shin-ichi Kyonggi Univ Dept Comp Sci Suwon South Korea Korea Adv Inst Sci & Technol Div Comp Sci Taejon 305701 South Korea Kyoto Univ Math Sci Res Inst Kyoto Japan
Given n points, called terminals, in the plane a"e(2) and a positive integer k, the bottleneck Steiner tree problem is to find k Steiner points from a"e(2) and a spanning tree on the n+k points that minimize... 详细信息
来源: 评论
exact algorithms for maximum independent set
收藏 引用
INFORMATION AND COMPUTATION 2017年 第Part1期255卷 126-146页
作者: Xiao, Mingyu Nagamochi, Hiroshi Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu Sichuan Peoples R China Kyoto Univ Dept Appl Math & Phys Grad Sch Informat Kyoto Japan
We show that the maximum independent set problem on an n-vertex graph can be solved in 1.1996(n)n(0)(1) time and polynomial space, which even is faster than Robson's 1.2109(n)n(0)(1) -time exponential-space algori... 详细信息
来源: 评论
exact algorithms for weak Roman domination
收藏 引用
DISCRETE APPLIED MATHEMATICS 2018年 248卷 79-92页
作者: Chapelle, Mathieu Cochefert, Manfred Couturier, Jean-Francois Kratsch, Dieter Letourneur, Romain Liedloff, Mathieu Perez, Anthony IFTS CReSTIC Pole Haute Technol F-08000 Charleville Mezieres France Univ Lorraine Lab Informat Theor & Appl F-57045 Metz 01 France Univ Orleans INSA Ctr Val Loire LIFO EA 4022 FR-45067 Orleans France
We consider the WEAK ROMAN DOMINATION problem. Given an undirected graph G = (V, E), the aim is to find a weak Roman domination function (wrd-function for short) of minimum cost, i.e. a function f : V -> {0, 1, 2} ... 详细信息
来源: 评论