Solving the Orienteering Problem through Branch-and-Cut

DOI10.1287/IJOC.10.2.133MaRDI QIDQ4427336zbMATH OpenOpenAlexFDO

Authors Matteo Fischetti, Juan-José Salazar-González, Paolo Toth

Publication date 1998

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/f418160139058493ae48576cc2a2b24aecce1a54

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Methods of successive quadratic programming type (90C55)

Recommendations

• The team orienteering problem: formulations and branch-cut and price
• A branch-and-cut algorithm for the orienteering arc routing problem
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• A branch-and-cut algorithm for the team orienteering problem
• The orienteering problem: a survey

Cited in

(only showing first 100 items - show all)

• The attractive traveling salesman problem
• Algorithms to solve the orienteering problem: A comparison
• Strong linear programming relaxations for the orienteering problem
• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
• Managing platelet supply through improved routing of blood collection vehicles
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
• The probabilistic orienteering problem
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
• An efficient evolutionary algorithm for the orienteering problem
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs
• The vehicle routing problem with service level constraints
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
• Formulations for the orienteering problem with additional constraints
• Decision support for flexible liner shipping
• Application of fuzzy optimization to the orienteering problem
• Local search inequalities
• Solving the team orienteering arc routing problem with a column generation approach
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• A TABU search heuristic for the team orienteering problem
• Locating median cycles in networks
• Coupling ant colony systems with strong local searches
• A tabu search algorithm for the probabilistic orienteering problem
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
• Boosting ant colony optimization via solution prediction and machine learning
• Exact algorithms for budgeted prize-collecting covering subgraph problems
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
• Hybrid evolutionary search for the traveling repairman problem with profits
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem
• An iterative three-component heuristic for the team orienteering problem with time windows
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
• The clustered team orienteering problem
• A branch-and-cut algorithm for the maximum covering cycle problem
• A branch-and-cut algorithm for the capacitated profitable tour problem
• An effective PSO-inspired algorithm for the team orienteering problem
• A fast solution method for the time-dependent orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• Evolution-inspired local improvement algorithm solving orienteering problem
• A column generation approach for the strong network orientation problem
• A stabilized column generation scheme for the traveling salesman subtour problem
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
• Classification, models and exact algorithms for multi-compartment delivery problems
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• Selective routing problem with synchronization
• A dynamic and probabilistic orienteering problem
• Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests
• Trip planning for visitors in a service system with capacity constraints
• The team orienteering problem: formulations and branch-cut and price
• The clustered orienteering problem
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• Integer programming formulations for the elementary shortest path problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• A two-stage approach to the orienteering problem with stochastic weights
• Solving the orienteering problem with time windows via the pulse framework
• Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
• Exact algorithms for the double vehicle routing problem with multiple stacks
• A branch-and-cut algorithm for the orienteering arc routing problem
• Solving the team orienteering problem with cutting planes
• An Optimal Algorithm for the Orienteering Tour Problem
• A hybrid algorithm for the DNA sequencing problem
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• Generalized orienteering problem with resource dependent rewards
• A branch-and-cut algorithm for the team orienteering problem
• Robust UAV mission planning
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• The Humanitarian pickup and distribution problem
• Robust multiperiod vehicle routing under customer order uncertainty
• Team Orienteering with Time-Varying Profit
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
• Solving relaxation orienteering problem using DCA-CUT
• Analysis of the maximum level policy in a production-distribution system
• Models for a Steiner ring network design problem with revenues
• Solving the team orienteering problem with nonidentical agents: A Lagrangian approach
• Clustered coverage orienteering problem of unmanned surface vehicles for water sampling
• A revisited branch-and-cut algorithm for large-scale orienteering problems
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
• The first AI4TSP competition: learning to solve stochastic routing problems
• An adaptive memory matheuristic for the set orienteering problem
• Adaptive solution prediction for combinatorial optimization
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• The orienteering problem: a survey
• The hazardous orienteering problem
• Dual-driven path elimination for vehicle routing with idle times and arrival-time consistency
• Formulations and algorithms for the simple cycle problem
• The team orienteering problem with service times and mandatory \& incompatible nodes
• A large neighborhood search-based approach to tackle the very large scale team orienteering problem in industrial context
• A survey on the traveling salesman problem and its variants in a warehousing context
• A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials
• A generalized set partitioning model for MinMax vehicle routing
• Heuristic algorithms for visiting the customers in a rolling schedule environment
• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• The effective application of a new approach to the generalized orienteering problem

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: Solving the Orienteering Problem through Branch-and-Cut

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