Integer optimization with penalized fractional values: the knapsack case (Q1631508): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2018.09.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2892881076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problems with split deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random knapsack in expected polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlinear knapsack problem - algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming algorithms for bin packing problems with item fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exactly solving packing problems with fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimization algorithm for a penalized knapsack 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 Multiperiod Single-Sourcing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of fragmentable object bin packing and an application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Dynamic Programming and Capital Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank

Latest revision as of 15:09, 17 July 2024

scientific article
Language Label Description Also known as
English
Integer optimization with penalized fractional values: the knapsack case
scientific article

    Statements

    Integer optimization with penalized fractional values: the knapsack case (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 December 2018
    0 references
    0 references
    packing
    0 references
    knapsack problem
    0 references
    dynamic programming
    0 references
    approximation algorithms
    0 references
    computational experiments
    0 references
    0 references
    0 references