Local-search based heuristics for advertisement scheduling
From MaRDI portal
Cites work
- A Branch Search Algorithm for the Knapsack Problem
- A Direct Descent Binary Knapsack Algorithm
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A polynomial-time approximation scheme for the MAXSPACE advertisement problem
- An Efficient Algorithm for the 0-1 Knapsack Problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Benchmarking optimization software with performance profiles.
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- BPPLIB: a library for bin packing and cutting stock problems
- Computing Partitions with Applications to the Knapsack Problem
- Dual inequalities for stabilized column generation revisited
- Dynamic programming algorithms for the zero-one knapsack problem
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Future paths for integer programming and links to artificial intelligence
- Greedy randomized adaptive search procedures
- Handbook of metaheuristics
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- scientific article; zbMATH DE number 2038780 (Why is no real title available?)
- scientific article; zbMATH DE number 2086937 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1418266 (Why is no real title available?)
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- Merging and Sorting Applied to the Zero-One Knapsack Problem
- NP-complete scheduling problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Performance bounds of algorithms for scheduling advertisements on a web page
- Scheduling advertisements on a web page to maximize revenue
- Scheduling space-sharing for internet advertising
- Statistical comparisons of classifiers over multiple data sets
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- Variable neighborhood search
Cited in
(1)
This page was built for publication: Local-search based heuristics for advertisement scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658437)
