scientific article; zbMATH DE number 7561426

DOI10.4230/LIPIcs.ISAAC.2018.72MaRDI QIDQ5091069

Yuval Shavitt, Galia Shabtai, Danny Raz

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorial optimizationapproximation algorithmsstochastic knapsackchance constraint

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity ⋮ Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates

Cites Work

• A PTAS for the chance-constrained knapsack problem with random item sizes
• Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes
• Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
• Allocating Bandwidth for Bursty Connections
• Stochastic combinatorial optimization via poisson approximation
• Unnamed Item
• Unnamed Item

This page was built for publication: