Allocation of advertising space by a web service provider using combinatorial auctions

DOI10.1007/BF02706245zbMath1096.90527OpenAlexW2026930306MaRDI QIDQ2571440

Sandeep Dulluri, N. R. Srinivasa Raghavan

Publication date: 8 November 2005

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02706245

zbMATH Keywords

ant-colony optimization (ACO)combinatorial auction problem (CAP)multi-dimensional knapsack problem (MDKP)online advertisements.web page service provider (WSP)winner-determination problem (WDP)

Mathematics Subject Classification ID

Games involving graphs (91A43) Auctions, bargaining, bidding and selling, and other market models (91B26) Marketing, advertising (90B60)

Uses Software

• MACS-VRPTW
• HAS-SOP

Cites Work

• Unnamed Item
• Unnamed Item
• Lagrangean methods for the 0-1 quadratic knapsack problem
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• The multidimensional 0-1 knapsack problem: an overview.
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Tractable combinatorial auctions and \(b\)-matching
• The package assignment model.
• Genetic algorithms with double strings for 0-1 programming problems
• Combinatorial auctions for electronic business
• Combinatorial Auctions: A Survey
• Ant colonies for the quadratic assignment problem
• An overview of heuristic solution methods
• Heuristics from Nature for Hard Combinatorial Optimization Problems
• Stochastic Algorithms: Foundations and Applications

This page was built for publication: Allocation of advertising space by a web service provider using combinatorial auctions