Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit (Q5223044): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing revenue with allocation of multiple advertisements on a Web banner / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for hard multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on upper bounds to the robust knapsack problem with discrete scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a two-agent single-machine scheduling problem considering learning effect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Banner Advertisements on the Web / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution method to solve large scale integer quadratic multidimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tear / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the budget-constrained multiple knapsack problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0217595919500143 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2944076076 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:01, 30 July 2024

scientific article; zbMATH DE number 7077141
Language Label Description Also known as
English
Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit
scientific article; zbMATH DE number 7077141

    Statements

    Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit (English)
    0 references
    0 references
    0 references
    0 references
    5 July 2019
    0 references
    advertisement scheduling
    0 references
    two-agent scheduling
    0 references
    branch-and-bound algorithm
    0 references
    upper bound
    0 references
    big data
    0 references

    Identifiers