Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem

DOI10.1016/j.cor.2020.105175OpenAlexW3113141242MaRDI QIDQ2027061

Geraldo Robson Mateus, Lucas Assunção

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.01530

zbMATH Keywords

metaheuristicspath relinkinglarge neighborhood searchfeasibility pumpmatheuristicsorienteering problems

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (3)

Boosting ant colony optimization via solution prediction and machine learning ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Combining an LNS-based approach and organizational mining for the resource replacement problem

Uses Software

• FEASPUMP
• LEMON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compact formulations of the Steiner traveling salesman problem and related problems
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• A matheuristic for the team orienteering arc routing problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• The multi-district team orienteering problem
• A branch-and-cut algorithm for the orienteering arc routing problem
• Solving the team orienteering problem with cutting planes
• The orienteering problem: a survey
• Heuristics for the multi-period orienteering problem with multiple time windows
• The worst-case time complexity for generating all maximal cliques and computational experiments
• A path relinking approach for the team orienteering problem
• The team orienteering problem
• Solving the team orienteering arc routing problem with a column generation approach
• A TABU search heuristic for the team orienteering problem
• A branch and cut algorithm for minimum spanning trees under conflict constraints
• The multi-visit team orienteering problem with precedence constraints
• Ten years of feasibility pump, and counting
• An effective PSO-inspired algorithm for the team orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• Improving the feasibility pump
• An exact algorithm for team orienteering problems
• The feasibility pump
• The Team Orienteering Problem: Formulations and Branch-Cut and Price
• A new approach to the maximum-flow problem
• Approximations of the critical region of the fbietkan statistic
• Faces for a linear inequality in 0–1 variables
• Facets of the knapsack polytope
• A branch‐and‐cut algorithm for the Team Orienteering Problem
• A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem