Capacitated ring arborescence problems with profits

DOI10.1007/s00291-018-0539-xzbMath1428.90032OpenAlexW2901492863WikidataQ128917385 ScholiaQ128917385MaRDI QIDQ2284638

Alessandro Hill, Roberto Baldacci, Edna A. Hoshino

Publication date: 15 January 2020

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-018-0539-x

zbMATH Keywords

mathematical programmingvehicle routing problemnetwork designorienteering problemprize-collecting Steiner tree problemring arborescence problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (2)

A branch-and-price algorithm for the ring-tree facility location problem ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal capacitated ring trees
• Models for a Steiner multi-ring network design problem with revenues
• The ring tree facility location problem
• The capacitated team orienteering problem with incomplete service
• The orienteering problem: a survey
• Iterated local search for the team orienteering problem with time windows
• The undirected capacitated arc routing problem with profits
• The school bus routing problem: a review
• Heuristic algorithms for the multi-depot ring-star problem
• The team orienteering problem
• A fast and effective heuristic for the orienteering problem
• Multistars, partial multistars and the capacitated vehicle routing problem
• Exact algorithms for bi-objective ring tree problems with reliability measures
• Generalized local branching heuristics and the capacitated ring tree problem
• Heuristics for the multi-vehicle covering tour problem
• Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
• The prize-collecting generalized minimum spanning tree problem
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Multi-exchange Neighborhoods for the Capacitated Ring Tree Problem
• The capacitated team orienteering and profitable tour problems
• A dual ascent approach for steiner tree problems on a directed graph
• The Capacitated m-Ring-Star Problem
• The prize collecting traveling salesman problem
• The Fixed-Outdegree 1-Arborescence Polytope
• The Covering Tour Problem
• Efficient path and vertex exchange in steiner tree algorithms
• The prize collecting traveling salesman problem: II. Polyhedral results
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks
• Variations of the prize‐collecting Steiner tree problem
• Models for a Steiner ring network design problem with revenues
• A comparison of Steiner tree relaxations
• Steiner Tree Problems With Profits

This page was built for publication: Capacitated ring arborescence problems with profits