A priori TSP in the scenario model
type: Item
instance of: scholarly article
title: A priori TSP in the scenario model
zbMATH Open document ID: 1409.90161
author: Martijn van Ee
author: Leo Van Iersel
author: Teun Janssen
author: René A. Sitters
published in: Discrete Applied Mathematics
publication date: 2018-10-26T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6966422
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: a priori optimization
zbMATH Keywords: master tour
zbMATH Keywords: optimization under scenarios
MaRDI profile type: Publication
OpenAlex ID: W2809282601
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Q4250161
cites work: Q2941635
cites work: On the probabilistic min spanning tree problem
cites work: Q5351897
cites work: Q4103312
cites work: Sometimes Travelling is Easy: The Master Tour Problem
cites work: A priori TSP in the Scenario Model
cites work: On the Complexity of Master Problems
cites work: Scheduling over Scenarios on Two Machines
cites work: Cyclic ordering is NP-complete
cites work: Some simplified NP-complete graph problems
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Improved Lower Bounds for the Universal and a priori TSP
cites work: Oblivious network design
cites work: Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
cites work: Improved lower and upper bounds for universal TSP in planar metrics
cites work: Some optimal inapproximability results
cites work: Q5501328
cites work: Reducibility among Combinatorial Problems
cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
cites work: Q4083461
cites work: Ramanujan graphs
cites work: Hedging uncertainty: approximation algorithms for stochastic optimization problems
cites work: Regular Graphs with Given Girth and Restricted Circuits
cites work: Algorithms for the universal and a priori TSP
cites work: A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
cites work: Deterministic sampling algorithms for network design
Wikidata QID: Q129359035
DOI: 10.1016/J.DAM.2018.04.002
description: scientific article; zbMATH DE number 6966422