A priori TSP in the scenario model (Q1801079): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: R. A. Sitters / rank
Normal rank
 
Property / author
 
Property / author: R. A. Sitters / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809282601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the probabilistic min spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5351897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sometimes Travelling is Easy: The Master Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priori TSP in the Scenario Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Master Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling over Scenarios on Two Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic ordering is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lower Bounds for the Universal and a priori TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower and upper bounds for universal TSP in planar metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hedging uncertainty: approximation algorithms for stochastic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Graphs with Given Girth and Restricted Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the universal and a priori TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant Approximation Algorithm for the a priori Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sampling algorithms for network design / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:20, 17 July 2024

scientific article
Language Label Description Also known as
English
A priori TSP in the scenario model
scientific article

    Statements

    A priori TSP in the scenario model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 October 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman problem
    0 references
    a priori optimization
    0 references
    master tour
    0 references
    optimization under scenarios
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references