咨询与建议

限定检索结果

文献类型

  • 230 篇 期刊文献
  • 64 篇 会议
  • 2 篇 学位论文
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 208 篇 工学
    • 177 篇 计算机科学与技术...
    • 35 篇 软件工程
    • 21 篇 电气工程
    • 9 篇 信息与通信工程
    • 8 篇 交通运输工程
    • 5 篇 电子科学与技术(可...
    • 5 篇 控制科学与工程
    • 4 篇 机械工程
    • 3 篇 土木工程
    • 3 篇 生物医学工程(可授...
    • 2 篇 核科学与技术
    • 2 篇 生物工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 冶金工程
    • 1 篇 网络空间安全
  • 158 篇 理学
    • 146 篇 数学
    • 10 篇 生物学
    • 9 篇 统计学(可授理学、...
    • 4 篇 物理学
    • 2 篇 化学
  • 97 篇 管理学
    • 96 篇 管理科学与工程(可...
    • 9 篇 工商管理
  • 15 篇 经济学
    • 11 篇 应用经济学
    • 4 篇 理论经济学
  • 6 篇 法学
    • 4 篇 法学
    • 2 篇 社会学
  • 3 篇 军事学
  • 2 篇 教育学
    • 2 篇 心理学(可授教育学...
  • 2 篇 农学
  • 1 篇 医学
    • 1 篇 临床医学
    • 1 篇 特种医学

主题

  • 297 篇 exact algorithms
  • 20 篇 graph algorithms
  • 19 篇 heuristics
  • 18 篇 parameterized co...
  • 16 篇 combinatorial op...
  • 15 篇 approximation al...
  • 14 篇 parameterized al...
  • 14 篇 scheduling
  • 10 篇 vehicle routing
  • 9 篇 fixed-parameter ...
  • 9 篇 dynamic programm...
  • 8 篇 np-hardness
  • 8 篇 complexity
  • 7 篇 maximum satisfia...
  • 6 篇 traveling salesm...
  • 6 篇 metaheuristics
  • 6 篇 survey
  • 6 篇 dominating set
  • 6 篇 treewidth
  • 6 篇 steiner tree

机构

  • 8 篇 univ elect sci &...
  • 6 篇 univ bergen dept...
  • 6 篇 univ tubingen wi...
  • 5 篇 univ bologna dei...
  • 5 篇 lund univ dept c...
  • 5 篇 univ jena inst i...
  • 4 篇 univ utrecht ins...
  • 4 篇 maastricht univ ...
  • 4 篇 univ utrecht dep...
  • 4 篇 tu berlin inst s...
  • 3 篇 univ warsaw inst...
  • 3 篇 univ utrecht dep...
  • 3 篇 univ talca dept ...
  • 3 篇 univ bologna dei...
  • 3 篇 univ bergen dept...
  • 3 篇 nyu dept comp sc...
  • 3 篇 univ elect sci &...
  • 3 篇 univ warsaw wars...
  • 3 篇 lebanese amer un...
  • 3 篇 florida state un...

作者

  • 12 篇 bodlaender hans ...
  • 11 篇 niedermeier rolf
  • 10 篇 xiao mingyu
  • 8 篇 van rooij johan ...
  • 8 篇 niedermeier r
  • 7 篇 delorme maxence
  • 6 篇 nederlof jesper
  • 6 篇 vigo daniele
  • 6 篇 fomin fedor v.
  • 5 篇 guo j
  • 5 篇 kratsch dieter
  • 5 篇 monaci michele
  • 5 篇 liedloff mathieu
  • 5 篇 gramm j
  • 5 篇 bredereck robert
  • 4 篇 pilipczuk marcin
  • 4 篇 iori manuel
  • 4 篇 sorge manuel
  • 4 篇 chen jiehua
  • 4 篇 nagamochi hirosh...

语言

  • 274 篇 英文
  • 23 篇 其他
检索条件"主题词=Exact algorithms"
297 条 记 录,以下是1-10 订阅
排序:
exact algorithms for continuous pricing with advanced discrete choice demand models
收藏 引用
OR SPECTRUM 2024年 1-47页
作者: Haering, Tom Legault, Robin Torres, Fabian Ljubic, Ivana Bierlaire, Michel Ecole Polytech Fed Lausanne EPFL Sch Architecture Civil & Environm Engn ENAC Transport & Mobil Lab Rte Cantonale CH-1015 Lausanne Vaud Switzerland MIT Operat Res Ctr Massachusetts Ave Cambridge MA 02139 USA ESSEC Business Sch Dept Informat Syst Decis Sci & Stat Ave Bernard Hirsch F-95000 Cergy France
We present a spatial Branch and Bound and spatial Branch and Benders Decomposition approach together with the Breakpoint exact Algorithm (BEA) to tackle the uncapacitated choice-based pricing problem (CPP) where deman... 详细信息
来源: 评论
Fast exact algorithms for the SAT problem with bounded occurrences of variables
收藏 引用
THEORETICAL COMPUTER SCIENCE 2025年 1029卷
作者: Peng, Junqiang Xiao, Mingyu Univ Elect Sci & Technol China Sch Comp Sci & Engn Chnegdu Peoples R China
We present fast algorithms for the general CNF satisfiability problem (SAT) with running-time bound O*(cd degrees), where cd is a function of the maximum occurrence d of variables (d can also be the average occurrence... 详细信息
来源: 评论
exact algorithms for scheduling programs with shared tasks
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2022年 第5期43卷 1602-1627页
作者: Kacem, Imed Lucarelli, Giorgio Naze, Theo Univ Lorraine LCOMS Metz France
We study a scheduling problem where the jobs we have to perform are composed of one or more tasks. If two jobs sharing a non-empty subset of tasks are scheduled on the same machine, then these shared tasks have to be ... 详细信息
来源: 评论
Fast exact algorithms for Survivable Network Design with Uniform Requirements
收藏 引用
ALGORITHMICA 2022年 第9期84卷 2622-2641页
作者: Agrawal, Akanksha Misra, Pranabendu Panolan, Fahad Saurabh, Saket Indian Inst Technol Madras Chennai Tamil Nadu India Chennai Math Inst Chennai Tamil Nadu India Indian Inst Technol Hyderabad Hyderabad India HBNI Inst Math Sci Chennai Tamil Nadu India Univ Bergen Bergen Norway
We design exact algorithms for the following two problems in survivable network design: (i) designing a minimum cost network with a desired value of edge connectivity, which is called MINIMUM WEIGHT lambda- CONNECTED ... 详细信息
来源: 评论
exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年 第4期45卷 98-98页
作者: Li, Jianping Xie, Runtao Lichen, Junran Hu, Guojun Pan, Pengxiang Yang, Ping Yunnan Univ Univ Town Sch Math & Stat East Outer Ring South Rd Kunming 650504 Peoples R China Beijing Univ Chem Technol Sch Math & Phys 15 North Third Ring East Rd Beijing 100029 Peoples R China
In this paper, we address the constrained parallel-machine scheduling problem with divisible processing times and penalties (the CPS-DTP problem), which is a further generalization of the parallel-machine scheduling p... 详细信息
来源: 评论
exact algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract)  27th
Exact Algorithms for Maximum Weighted Independent Set on Spa...
收藏 引用
27th International Computing and Combinatorics Conference (COCOON)
作者: Huang, Sen Xiao, Mingyu Chen, Xiaoyu Univ Elect Sci & Technol China Chengdu Peoples R China Nanjing Univ Nanjing Peoples R China
The maximum independent set problem is one of the most important problems in graph algorithms and has been extensively studied in the line of research on the worst-case analysis of exact algorithms for NP-hard problem... 详细信息
来源: 评论
exact algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks
收藏 引用
INFORMS JOURNAL ON COMPUTING 2022年 第4期34卷 1987-2002页
作者: Casazza, Marco Ceselli, Alberto Univ Milan Dipartimento Informat I-20133 Milan Italy
We tackle an optimization problem arising in the design of sensor networks: given a set of sensors, only one being connected to a backbone, to establish connection routes from each of them to the sink. Under a shortes... 详细信息
来源: 评论
exact algorithms for the 0-1 Time-Bomb Knapsack Problem
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2022年 145卷 1页
作者: Monaci, Michele Pike-Burke, Ciara Santini, Alberto Univ Bologna Dept Elect Elect & Informat Engn Bologna Italy Imperial Coll London Dept Math London England Univ Pompeu Fabra Dept Econ & Business Barcelona Spain
We consider a stochastic version of the 0-1 Knapsack Problem in which, in addition to profit and weight, each item is associated with a probability of exploding and destroying all the contents of the knapsack. The obj... 详细信息
来源: 评论
New exact algorithms for planar maximum covering location by ellipses problems
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2021年 第1期291卷 114-127页
作者: Tedeschi, Danilo Andretta, Marina Univ Sao Paulo Inst Ciencias Matemat & Comp Dept Matemt Aplicada & Estat Ave Trabalhador Sao Carlense 400 BR-13566590 Sao Carlos SP Brazil
Planar Maximum Covering Location by Ellipses is an optimization problem where one wants to choose the location of ellipses given their major and minor axes to cover demand points, maximizing a function depending on th... 详细信息
来源: 评论
exact and parameterized algorithms for the independent cutset problem
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2025年 148卷
作者: Rauch, Johannes Rautenbach, Dieter Souza, Ueverton S. Ulm Univ Inst Optimizat & Operat Res Ulm Germany Univ Fed Fluminense Inst Computacao Niteroi Brazil
The INDEPENDENT CUTSET problem asks whether there is a set of vertices in a given graph that is both independent and a cutset. This problem is NP-complete even when the input graph is planar and has maximum degree fiv... 详细信息
来源: 评论