A branch-and-cut algorithm for the profitable windy rural postman problem

DOI10.1016/J.EJOR.2015.10.016MaRDI QIDQ321108zbMATHOpenAlexFDO

Authors Thais Ávila, Isaac Plana, Ángel Corberán, José M. Sanchis

Publication date 7 October 2016

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

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

zbMATH Keywords

polyhedronarc routingbranch-and-cut algorithmprofitswindy rural postman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• The directed profitable location rural postman problem
• A branch & cut algorithm for the windy general routing problem and special cases
• A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
• Solving the prize-collecting rural postman problem
• A branch-and-price algorithm for the windy rural postman problem

Cites work

• scientific article; zbMATH DE number 1568941 (Why is no real title available?)
• scientific article; zbMATH DE number 6741969 (Why is no real title available?)
• A branch & cut algorithm for the windy general routing problem and special cases
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem
• A matheuristic for the team orienteering arc routing problem
• A polyhedral approach to the rural postman problem
• An ILP-refined tabu search for the directed profitable rural postman problem
• An algorithm for the Rural Postman problem on a directed graph
• An artificial bee colony approach for the undirected capacitated arc routing problem with profits
• Approximate solutions for the maximum benefit chinese postman problem
• Arc Routing
• Improvement Procedures for the Undirected Rural Postman Problem
• Integer Programming and Combinatorial Optimization
• Local search for the undirected capacitated arc routing problem with profits
• Modeling the Pre Auction Stage The Truckload Case
• New results for the directed profitable rural postman problem
• Odd Minimum Cut-Sets and b-Matchings
• Plowing with precedence: a variant of the windy postman problem
• Privatized rural postman problems
• Profitable mixed capacitated arc routing and related problems
• Solving the prize-collecting rural postman problem
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• The capacitated arc routing problem: Valid inequalities and facets
• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• The orienteering problem: a survey
• The time-dependent prize-collecting arc routing problem
• The undirected capacitated arc routing problem with profits
• Vehicle Routing

Cited in

(26)

• On path ranking in time-dependent graphs
• A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
• A metaheuristic for the min-max windy rural postman problem with K vehicles
• New heuristic algorithms for the windy rural postman problem
• A comprehensive survey on the generalized traveling salesman problem
• Lower bounds and heuristics for the windy rural postman problem
• The generalized arc routing problem
• A study of rural logistics center location based on intuitionistic fuzzy TOPSIS
• A branch-and-cut algorithm for the windy profitable location rural postman problem
• The directed profitable location rural postman problem
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
• The profitable close-enough arc routing problem
• A cutting plane algorithm for the windy postman problem
• An updated annotated bibliography on arc routing problems
• Privatized rural postman problems
• Min-Max \(K\)-vehicles windy rural postman problem
• Arc routing problems: A review of the past, present, and future
• A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
• New results for the directed profitable rural postman problem
• A branch & cut algorithm for the windy general routing problem and special cases
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
• The directed profitable rural postman problem with incompatibility constraints
• A branch-and-price algorithm for the windy rural postman problem
• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
• Integer programming formulation and polyhedral results for windy collaborative arc routing problem
• Solving the prize-collecting rural postman problem

This page was built for publication: A branch-and-cut algorithm for the profitable windy rural postman problem

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