A two-stage approach to the orienteering problem with stochastic weights (Q336923): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Kristiaan M. Glorie / rank
Normal rank
 
Property / author
 
Property / author: Kristiaan M. Glorie / 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.2013.09.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011268617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering 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: The orienteering problem: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized fixed-charge network design problem / 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: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the multiple tour maximum collection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust UAV mission planning / 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: An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method for stochastic global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo bounding techniques for determinig solution quality in stochastic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sample Average Approximation Method for Stochastic Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Orienteering Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and effective heuristic for the orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724690 / rank
 
Normal rank

Latest revision as of 22:45, 12 July 2024

scientific article
Language Label Description Also known as
English
A two-stage approach to the orienteering problem with stochastic weights
scientific article

    Statements

    A two-stage approach to the orienteering problem with stochastic weights (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    uncertain orienteering problem
    0 references
    stochastic programming
    0 references
    stochastic heuristic
    0 references
    0 references