A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2620796999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics and lower bounds for the bin packing problem with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-weight stable sets and safe lower bounds for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reactive local search-based algorithm for the disjunctively constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the disjunctively constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knapsack Problem with Conflict Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:12, 14 July 2024

scientific article; zbMATH DE number 6821364
Language Label Description Also known as
English
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
scientific article; zbMATH DE number 6821364

    Statements

    A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (English)
    0 references
    0 references
    0 references
    0 references
    29 December 2017
    0 references
    0 references
    knapsack problem
    0 references
    maximum weight stable set problem
    0 references
    branch and bound
    0 references
    combinatorial optimization
    0 references
    computational experiments
    0 references
    0 references