scientific article; zbMATH DE number 6783498

zbMath1373.68450MaRDI QIDQ5365145

Ashish Goel, Sanjeev Khanna, Anand Bhalgat

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133163

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (32)

Packing a Knapsack of Unknown Capacity ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ Robust optimization approach for a chance-constrained binary knapsack problem ⋮ Exact algorithms for the 0-1 time-bomb knapsack problem ⋮ Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem ⋮ Non-adaptive stochastic score classification and explainable halfspace evaluation ⋮ Knapsack with variable weights satisfying linear constraints ⋮ Configuration balancing for stochastic requests ⋮ On the adaptivity gap of stochastic orienteering ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Stochastic graph exploration with limited resources ⋮ Stochastic Probing with Increasing Precision ⋮ Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards ⋮ The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature ⋮ Approximability of the two-stage stochastic knapsack problem with discretely distributed weights ⋮ Stochastic Unsplittable Flows ⋮ Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem ⋮ Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ Unnamed Item ⋮ A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes ⋮ Unnamed Item ⋮ A fully polynomial-time approximation scheme for approximating a sum of random variables ⋮ Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity ⋮ Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms ⋮ Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems ⋮ Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ Stochastic graph exploration ⋮ Unnamed Item ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ Unnamed Item ⋮ Adaptive Bin Packing with Overflow

This page was built for publication: