scientific article; zbMATH DE number 7053373

MaRDI QIDQ5743496zbMATH OpenFDO

Authors Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi

Publication date 10 May 2019

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15) Approximation algorithms (68W25) Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36)

Recommendations

• scientific article; zbMATH DE number 1839476
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
• Approximation algorithms for the arc orienteering problem
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Approximation algorithms for time-dependent orienteering.
• Optimization approaches for solving chance constrained stochastic orienteering problems
• An Optimal Algorithm for the Orienteering Tour Problem
• Constant approximation for stochastic orienteering problem with \((1+\epsilon)\)-budget relaxation
• Approximation algorithms for stochastic \(k\)-TSP
• scientific article; zbMATH DE number 5764858

Cites work

• scientific article; zbMATH DE number 2185610 (Why is no real title available?)
• scientific article; zbMATH DE number 5764858 (Why is no real title available?)
• Approximating Matches Made in Heaven
• Approximating Optimal Binary Decision Trees
• Approximating the stochastic Knapsack problem: the benefit of adaptivity
• Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
• Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Approximation algorithms for budgeted learning problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Improved approximation results for stochastic knapsack problems
• Multi-armed Bandits with Metric Switching Costs
• On tail probabilities for martingales
• The Euclidean Orienteering Problem Revisited
• The orienteering problem with stochastic travel and service times

Cited in

(17)

• A dynamic and probabilistic orienteering problem
• scientific article; zbMATH DE number 7650116 (Why is no real title available?)
• Approximation algorithms for stochastic \(k\)-TSP
• On the adaptivity gap of stochastic orienteering
• The robot routing problem for collecting aggregate stochastic rewards
• scientific article; zbMATH DE number 7650393 (Why is no real title available?)
• Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
• On the adaptivity gap of stochastic orienteering
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
• Prize-collecting TSP with a budget constraint
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Ignorance is almost bliss: near-optimal stochastic matching with few queries
• The probabilistic orienteering problem
• Tour recommendation for groups
• scientific article; zbMATH DE number 1839476 (Why is no real title available?)
• Approximation algorithms for stochastic combinatorial optimization problems
• Constant approximation for stochastic orienteering problem with \((1+\epsilon)\)-budget relaxation

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