An exact approach for the 0-1 knapsack problem with setups (Q1652189): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Frederico Della Croce / rank
Normal rank
 
Property / author
 
Property / author: Frederico Della Croce / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / 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.1016/j.cor.2016.11.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2553041823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic solution approaches for the mixed integer setup knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate and exact algorithms for the fixed-charge knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cross entropy algorithm for the Knapsack problem with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms For The Setup Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for the knapsack problem with setup / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3081837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved LP-based algorithms for the closest string problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trends in exact algorithms for the \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the bounded set-up knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the Knapsack problem with setup / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:08, 16 July 2024

scientific article
Language Label Description Also known as
English
An exact approach for the 0-1 knapsack problem with setups
scientific article

    Statements

    An exact approach for the 0-1 knapsack problem with setups (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    knapsack problem with setups
    0 references
    exact approach
    0 references
    0-1 programming
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references