Expectation analysis for bounding solutions of the 0-1 knapsack problem
type: Item
instance of: scholarly article
title: Expectation analysis for bounding solutions of the 0-1 knapsack problem
author: Fernando A. Morales
author: Jairo A. Martínez
published in: Computational and Applied Mathematics
publication date: 2024-11-12T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q87
Mathematics Subject Classification ID: 05A19
zbMATH DE Number: 7942366
zbMATH Keywords: probabilistic analysis of algorithms
zbMATH Keywords: 0-1 knapsack problem
zbMATH Keywords: discrete optimization
MaRDI profile type: Publication
cites work: Q3579794
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Minimum and worst-case performance ratios of rollout algorithms
cites work: Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes
cites work: Q3065693
cites work: Discrete Probability Models and Methods
cites work: Knapsack problems -- an overview of recent advances. I: Single knapsack problems
cites work: Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
cites work: Hard Knapsack Problems
cites work: Greedy algorithms for the minimization knapsack problem: average behavior
cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
cites work: A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
cites work: A new class of hard problem instances for the 0-1 knapsack problem
cites work: Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
cites work: Reducibility among Combinatorial Problems
cites work: Q3792481
cites work: A New Algorithm for the 0-1 Knapsack Problem
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Average-case performance of rollout algorithms for knapsack problems
cites work: Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem
cites work: Algorithms for the one-dimensional two-stage cutting stock problem
cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem
cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights
cites work: Dynamic programming on the word RAM
cites work: Where are the hard knapsack problems?
cites work: Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
DOI: 10.1007/S40314-024-02938-6
description: scientific article; zbMATH DE number 7942366