A Graph Theoretic Approach to Solve Special Knapsack Problems in Polynomial Time

被引：0
|
作者：
Rehs, Carolin [1 ]
Gurski, Frank [1 ]
机构：
[1] Univ Dusseldorf, Inst Comp Sci, Algorithm Hard Problems Grp, D-40225 Dusseldorf, Germany
来源：
OPERATIONS RESEARCH PROCEEDINGS 2017 | 2018年
关键词：
COMPLEXITY;
D O I：
10.1007/978-3-319-89920-6_40
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
引用
收藏
页码：295 / 301
页数：7
相关论文
共 50 条
  • [1] Graph-Theoretic Algorithms for Polynomial Optimization Problems
    Sojoudi, Somayeh
    Madani, Ramtin
    Fazelnia, Ghazal
    Lavaei, Javad
    [J]. 2014 IEEE 53RD ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2014, : 2257 - 2271
  • [2] A Novel Method to Solve Neural Knapsack Problems
    Li, Duanshun
    Liu, Jing
    Lee, Dongeun
    Seyedmazloom, Ali
    Kaushik, Giridhar
    Lee, Kookjin
    Park, Noseong
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [3] A detection theoretic approach to modeling aviation security problems using the knapsack problem
    Jacobson, S.H.
    Kobza, J.E.
    Easterling, A.S.
    [J]. IIE Transactions (Institute of Industrial Engineers), 2001, 33 (09): : 747 - 759
  • [4] A detection theoretic approach to modeling aviation security problems using the knapsack problem
    Jacobson, SH
    Kobza, JE
    Easterling, AS
    [J]. IIE TRANSACTIONS, 2001, 33 (09) : 747 - 759
  • [5] New polynomial-time instances to various knapsack-type problems
    Aho, I
    [J]. FUNDAMENTA INFORMATICAE, 2002, 53 (3-4) : 199 - 228
  • [6] A novel approach to solve AI planning problems in graph transformations
    Pira, Einollah
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2020, 92
  • [7] Random knapsack in expected polynomial time
    Beier, R
    Vöcking, B
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2004, 69 (03) : 306 - 329
  • [8] Structure oriented search algorithm to solve knapsack problems
    Yoshizawa, H
    Hashimoto, S
    [J]. 2004 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN & CYBERNETICS, VOLS 1-7, 2004, : 5941 - 5946
  • [9] Recognizing Graph Theoretic Properties with Polynomial Ideals
    De Loera, Jesus A.
    Hillar, Christopher J.
    Malkin, Peter N.
    Omar, Mohamed
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
  • [10] Time Complexity and Parallel Speedup of Relational Queries to Solve Graph Problems
    Ordonez, Carlos
    Tosic, Predrag T.
    [J]. DATABASE AND EXPERT SYSTEMS APPLICATIONS (DEXA 2018), PT II, 2018, 11030 : 339 - 349
12345