scientific article; zbMATH DE number 7053373

zbMATH Open1423.90106MaRDI QIDQ5743496FDOQ5743496

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

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

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

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)

Cites Work

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

Cited In (17)

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

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)