The probabilistic orienteering problem (Q1652250): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56524200, #quickstatements; #temporary_batch_1706974296281
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2016.12.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2562459738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on matheuristics for routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: The value of the stochastic solution in stochastic linear programs with fixed recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem with stochastic travel and service times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Challenges and Advances in A Priori Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-stage approach to the orienteering problem with stochastic weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Optimization of the Probabilistic Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a stochastic selective travelling salesperson problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a generalized traveling salesperson problem with stochastic customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On estimating the distribution of optimal traveling salesman tour lengths using heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the probabilistic traveling salesman problem with deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priori orienteering with time windows and stochastic wait times at customers / rank
 
Normal rank

Latest revision as of 02:09, 16 July 2024

scientific article
Language Label Description Also known as
English
The probabilistic orienteering problem
scientific article

    Statements

    The probabilistic orienteering problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    stochastic routing
    0 references
    orienteering problem
    0 references
    probabilistic TSP
    0 references
    l-shaped method
    0 references
    matheuristics
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references