Knapsack problem with objective value gaps (Q2361124): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Alexandre Dolgui / rank
Normal rank
 
Property / author
 
Property / author: Alain Quilliot / rank
Normal rank
 
Property / author
 
Property / author: Alexandre Dolgui / rank
 
Normal rank
Property / author
 
Property / author: Alain Quilliot / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-016-1043-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2395067356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Weight Subgraphs and the k-Sum Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact arborescences, matchings and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route problem with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching of given weight in complete and complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fully polynomial time approximation scheme for the Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <sc>fptas</sc> for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of restricted spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Problems: Reductibility and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Problems: Reductibility and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A provably tight delay-driven concurrently congestion mitigating global routing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding, minimizing, and counting weighted subgraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:58, 14 July 2024

scientific article
Language Label Description Also known as
English
Knapsack problem with objective value gaps
scientific article

    Statements

    Knapsack problem with objective value gaps (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2017
    0 references
    0 references
    knapsack problem
    0 references
    computational complexity
    0 references
    fully polynomial time approximation scheme
    0 references
    forbidden values
    0 references
    0 references