Team Orienteering with Time-Varying Profit
DOI10.1287/IJOC.2020.1026zbMATH Open1492.90023OpenAlexW3133492686MaRDI QIDQ5084650FDOQ5084650
Authors: Qinxiao Yu, Yossiri Adulyasak, Louis-Martin Rousseau, Ning Zhu, Shoufeng Ma 
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2020.1026
Recommendations
- Robust Team Orienteering Problem with Decreasing Profits
- The team orienteering problem
- The orienteering problem with variable profits
- The capacitated team orienteering and profitable tour problems
- An iterated local search algorithm for the team orienteering problem with variable profits
- On a model and optimization algorithms for a dynamic team orienteering problem
- The multi-district team orienteering problem
- Time dependent orienteering problem with time windows and service time dependent profits
- An exact algorithm for team orienteering problems
team orienteeringhybrid heuristicrouting and schedulingmixed integer nonconvex programmingBenders branch-and-cut
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Algorithm 733: TOMP–Fortran modules for optimal control calculations
- DC programming: overview.
- Emergency response in natural disaster management: allocation and scheduling of rescue units
- The orienteering problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The orienteering problem: a survey
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- The team orienteering problem
- Title not available (Why is that?)
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Solving the Orienteering Problem through Branch-and-Cut
- The orienteering problem with variable profits
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- A class of globally convergent optimization methods based on conservative convex separable approximations
- A two-phase algorithm for the cyclic inventory routing problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Title not available (Why is that?)
- Generalized orienteering problem with resource dependent rewards
- The maximum collection problem with time-dependent rewards
- Production scheduling and vehicle routing with time windows for perishable food products
- A convex optimization approach for solving the single-vehicle cyclic inventory routing problem
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- The Benders decomposition algorithm: a literature review
- Derivative-free and blackbox optimization
- A matheuristic approach to the orienteering problem with service time dependent profits
- The demand weighted vehicle routing problem
- Glider routing and trajectory optimisation in disaster assessment
- An exact branch-and-price algorithm for scheduling rescue units during disaster response
- An iterated local search algorithm for the team orienteering problem with variable profits
Cited In (4)
- An exact branch-and-price algorithm for scheduling rescue units during disaster response
- Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
- Analysis of the selective traveling salesman problem with time-dependent profits
- Robust Team Orienteering Problem with Decreasing Profits
Uses Software
This page was built for publication: Team Orienteering with Time-Varying Profit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084650)
