scientific article; zbMATH DE number 4047112

zbMATH Open0642.68083MaRDI QIDQ3783565FDOQ3783565

Authors: C. Vercellis, Alberto Marchetti-Spaccamela 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• Stochastic on-line knapsack problems
• Average-Case Analysis of Off-Line and On-Line Knapsack Problems
• Publication:4886047
• Online minimization knapsack problem
• Online knapsack revisited

zbMATH Keywords

on-line algorithms\(\{\) 0,1\(\}\) knapsack problemrelaxed knapsack problem

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited In (8)

• On-line potato-sack algorithm efficient for packing into small boxes
• Online Knapsack Problems with Limited Cuts
• Algorithms for randomized time-varying knapsack problems
• Title not available (Why is that?)
• Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
• Average-Case Analysis of Off-Line and On-Line Knapsack Problems
• Title not available (Why is that?)
• Finite-State Online Algorithms and Their Automated Competitive Analysis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783565)