A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.ejor.2011.10.049 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020203251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single-item economic lot-sizing problem with a non-uniform resource: Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive half-products and scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster fully polynomial approximation scheme for the single-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the complexities of approximation algorithms for optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated two-parallel machines scheduling to minimize sum of job completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching and scheduling in a multi-machine flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for a supply scheduling problem with non-monotone cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with availability constraints to minimize total weighted completion times / rank
 
Normal rank

Latest revision as of 14:15, 5 July 2024

scientific article
Language Label Description Also known as
English
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
scientific article

    Statements

    A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (English)
    0 references
    0 references
    16 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    quadratic knapsack
    0 references
    FPTAS
    0 references
    strongly polynomial time
    0 references
    machine scheduling
    0 references
    0 references