scientific article; zbMATH DE number 7561426

DOI10.4230/LIPICS.ISAAC.2018.72MaRDI QIDQ5091069FDOQ5091069

Yuval Shavitt, Galia Shabtai, Danny Raz

Publication date: 21 July 2022

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

zbMATH Keywords

combinatorial optimizationapproximation algorithmsstochastic knapsackchance constraint

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Approximation algorithms for reliable stochastic combinatorial optimization
• Allocating Bandwidth for Bursty Connections
• Title not available (Why is that?)
• A PTAS for the chance-constrained knapsack problem with random item sizes
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
• Stochastic combinatorial optimization via poisson approximation
• Title not available (Why is that?)

Cited In (3)

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

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 Q5091069)