Proportion-based robust optimization and team orienteering problem with interval data

DOI10.1016/J.EJOR.2012.10.038MaRDI QIDQ2253537zbMATH OpenOpenAlexFDO

Authors Liangjun Ke, Ke Shang, Xueming Qian, Zongben Xu, Zuren Feng

Publication date 27 July 2014

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2012.10.038

zbMATH Keywords

combinatorial optimizationrobust optimizationvehicle routing problemuncertainty modelingteam orienteering problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• Robust Team Orienteering Problem with Decreasing Profits
• Two-stage robust optimization for the orienteering problem with stochastic weights
• On a model and optimization algorithms for a dynamic team orienteering problem
• The team orienteering problem: formulations and branch-cut and price
• An iterated local search algorithm for the team orienteering problem with variable profits
• Optimization approaches for solving chance constrained stochastic orienteering problems
• On the algorithmic solution of optimization problems subject to probabilistic/robust (probust) constraints
• The capacitated team orienteering problem: a bi-level filter-and-fan method
• Exact and heuristic algorithms for the interval data robust assignment problem
• The capacitated team orienteering and profitable tour problems

Cited in

(1)

• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach

This page was built for publication: Proportion-based robust optimization and team orienteering problem with interval data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253537)