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

DOI10.1007/S10479-024-06161-8MaRDI QIDQ6644370zbMATH OpenFDO

Authors M. Khorramizadeh, Roghayeh Javvi

Publication date 27 November 2024

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-024-06161-8

zbMATH Keywords

arc routingbranch and cutfacility locationwindy graph

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX) Operations research and management science (90Bxx) Mathematical programming (90Cxx)

Recommendations

• A branch-and-cut algorithm for the profitable windy rural postman problem
• New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
• A branch-and-price algorithm for the windy rural postman problem
• A branch-and-cut algorithm for the undirected rural postman problem
• New results on the windy postman problem

Cites work

• A branch & cut algorithm for the windy general routing problem and special cases
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
• A branch-and-cut algorithm for the orienteering arc routing problem
• A branch-and-cut algorithm for the profitable windy rural postman problem
• A polyhedral approach to the rural postman problem
• A survey of recent research on location-routing problems
• An algorithm for the Rural Postman problem on a directed graph
• Approximation algorithms for group prize-collecting and location-routing problems
• Arc Routing
• Combined location-routing problems: A synthesis and future research directions
• Eulerian location problems
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• Location-arc routing problem: heuristic approaches and test instances
• Location-routing: issues, models and methods
• Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
• Lower bounds and heuristics for the windy rural postman problem
• New inequalities for the general routing problem
• Odd Minimum Cut Sets and b-Matchings Revisited
• Odd Minimum Cut-Sets and b-Matchings
• The capacitated arc routing problem with intermediate facilities
• The capacitated arc routing problem with refill points
• The directed profitable location rural postman problem
• The synchronized arc and node routing problem: application to road marking
• The vehicle routing problem. Latest advances and new challenges.
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• Vehicle Routing

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

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