The TV advertisements scheduling problem (Q1733325): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-018-1251-0 / 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-018-1251-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2791113818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The local-global conjecture for scheduling with non-linear cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TV-break packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Commercial Videotapes in Broadcast Television / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Commercials on Broadcast Television / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Sequencing on an Unreliable Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand / 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: Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Techniques for Scheduling on a Machine with Varying Speed / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical programming study of advertising allocation problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single machine weighted mean squared deviation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the single machine scheduling problem minimizing total weighted delay penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: For the airplane refueling problem local precedence implies global precedence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logistics and matter-element models based on firm innovative supply chains / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130074983 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-018-1251-0 / rank
 
Normal rank

Latest revision as of 06:36, 11 December 2024

scientific article
Language Label Description Also known as
English
The TV advertisements scheduling problem
scientific article

    Statements

    The TV advertisements scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2019
    0 references
    scheduling
    0 references
    TV rating points
    0 references
    dynamic programming
    0 references
    fully polynomial time approximation scheme
    0 references
    \(K\)-approximation sets and functions
    0 references
    0 references

    Identifiers