Pages that link to "Item:Q3503857"
From MaRDI portal
The following pages link to A Constant Approximation Algorithm for the a priori Traveling Salesman Problem (Q3503857):
Displayed 11 items.
- Deterministic sampling algorithms for network design (Q547282) (← links)
- The A priori traveling repairman problem (Q722527) (← links)
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← links)
- Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
- A priori TSP in the scenario model (Q1801079) (← links)
- Approximation algorithms for the a priori traveling repairman (Q2661528) (← links)
- Designing Cost-Sharing Methods for Bayesian Games (Q2819469) (← links)
- On the Complexity of Master Problems (Q2946425) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- Routing Under Uncertainty: The a priori Traveling Repairman Problem (Q3453299) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)