The undirected capacitated general routing problem with profits

DOI10.1016/j.ejor.2016.08.001zbMath1394.90075OpenAlexW4249675057MaRDI QIDQ1752868

Demetrio Laganà, Francesca Vocaturo, Luca Bertazzi, Claudia Archetti

Publication date: 24 May 2018

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

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

zbMATH Keywords

branch-and-cutprofitsgeneral routingaggregate formulation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (7)

A profit-maximization location-routing-pricing problem: a branch-and-price algorithm ⋮ A dynamic multi-period general routing problem arising in postal service and parcel delivery systems ⋮ A scatter search algorithm for time-dependent prize-collecting arc routing problems ⋮ A hybrid metaheuristic for smart waste collection problems with workload concerns ⋮ Arc routing problems: A review of the past, present, and future ⋮ The periodic rural postman problem with irregular services on mixed graphs ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-phase branch-and-cut for the mixed capacitated general routing problem
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• A lower bound for the node, edge, and arc routing problem
• Modeling and solving the mixed capacitated general routing problem
• The orienteering problem: a survey
• Solving the prize-collecting rural postman problem
• On the cycle polytope of a binary matroid
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• The hot strip mill production scheduling problem: A tabu search approach
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• A cutting plane algorithm for the capacitated arc routing problem
• The distance constrained multiple vehicle traveling purchaser problem
• Privatized rural postman problems
• The mixed capacitated general routing problem under uncertainty
• Vehicle Routing
• The capacitated team orienteering and profitable tour problems
• The Capacitated Arc Routing Problem: Lower bounds
• Arc Routing Problems, Part II: The Rural Postman Problem

This page was built for publication: The undirected capacitated general routing problem with profits