Local-search based heuristics for advertisement scheduling

DOI10.1051/ro/2024114MaRDI QIDQ6658437

Rafael Crivellari Saliba Schouery, Mauro Roberto Costa da Silva

Publication date: 8 January 2025

Published in: RAIRO. Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsschedulingpackingadvertisementslocal-search

Mathematics Subject Classification ID

Analysis of algorithms (68W40) General topics in the theory of algorithms (68W01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Maximizing revenue with allocation of multiple advertisements on a Web banner
• Dynamic programming algorithms for the zero-one knapsack problem
• NP-complete scheduling problems
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Variable neighborhood search
• Performance bounds of algorithms for scheduling advertisements on a web page
• Scheduling space-sharing for internet advertising
• BPPLIB: a library for bin packing and cutting stock problems
• Greedy randomized adaptive search procedures
• Future paths for integer programming and links to artificial intelligence
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• A polynomial-time approximation scheme for the MAXSPACE advertisement problem
• Scheduling advertisements on a web page to maximize revenue
• Dual Inequalities for Stabilized Column Generation Revisited
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• Fast Approximation Algorithms for Knapsack Problems
• Merging and Sorting Applied to the Zero-One Knapsack Problem
• Computing Partitions with Applications to the Knapsack Problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• A Direct Descent Binary Knapsack Algorithm
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• A Branch Search Algorithm for the Knapsack Problem
• Handbook of metaheuristics
• Benchmarking optimization software with performance profiles.

This page was built for publication: Local-search based heuristics for advertisement scheduling