scientific article; zbMATH DE number 7053373
From MaRDI portal
Publication:5743496
zbMath1423.90106MaRDI QIDQ5743496
R. Ravi, Viswanath Nagarajan, Ravishankar Krishnaswamy, Anupam Gupta
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095237
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stochastic programming (90C15) Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36) Approximation algorithms (68W25)
Related Items (7)
Approximation algorithms for stochastic combinatorial optimization problems ⋮ On the adaptivity gap of stochastic orienteering ⋮ Unnamed Item ⋮ Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems ⋮ Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries ⋮ Tour recommendation for groups ⋮ Prize-Collecting TSP with a Budget Constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The orienteering problem with stochastic travel and service times
- On tail probabilities for martingales
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- Approximating Optimal Binary Decision Trees
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
- The Euclidean Orienteering Problem Revisited
- Approximating Matches Made in Heaven
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Multi-armed Bandits with Metric Switching Costs
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
This page was built for publication:
