A branch-and-cut algorithm for the profitable windy rural postman problem
DOI10.1016/J.EJOR.2015.10.016zbMATH Open1346.90074OpenAlexW2192217525MaRDI QIDQ321108FDOQ321108
Thais Ávila, José M. Sanchis, Ángel Corberán, Isaac Plana
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
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)
Cites Work
- The orienteering problem: a survey
- Integer Programming and Combinatorial Optimization
- Solving the prize-collecting rural postman problem
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
- Privatized rural postman problems
- New results for the directed profitable rural postman problem
- The time-dependent prize-collecting arc routing problem
- An algorithm for the Rural Postman problem on a directed graph
- An ILP-refined tabu search for the directed profitable rural postman problem
- Local search for the undirected capacitated arc routing problem with profits
- Modeling the Pre Auction Stage The Truckload Case
- A polyhedral approach to the rural postman problem
- The capacitated arc routing problem: Valid inequalities and facets
- Profitable mixed capacitated arc routing and related problems
- Vehicle Routing
- A matheuristic for the team orienteering arc routing problem
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
- Odd Minimum Cut-Sets and b-Matchings
- Improvement Procedures for the Undirected Rural Postman Problem
- Title not available (Why is that?)
- Arc Routing
- Title not available (Why is that?)
- A branch & cut algorithm for the windy general routing problem and special cases
- The undirected capacitated arc routing problem with profits
- An artificial bee colony approach for the undirected capacitated arc routing problem with profits
- Plowing with precedence: a variant of the windy postman problem
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- Approximate solutions for the maximum benefit chinese postman problem
Cited In (18)
- A comprehensive survey on the generalized traveling salesman problem
- New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem
- A study of rural logistics center location based on intuitionistic fuzzy TOPSIS
- New heuristic algorithms for the windy rural postman problem
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- The directed profitable rural postman problem with incompatibility constraints
- The profitable close-enough arc routing problem
- A metaheuristic for the min-max windy rural postman problem with K vehicles
- An updated annotated bibliography on arc routing problems
- Arc routing problems: A review of the past, present, and future
- Integer programming formulation and polyhedral results for windy collaborative arc routing problem
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
- The generalized arc routing problem
- On path ranking in time-dependent graphs
- A branch-and-cut algorithm for the windy profitable location rural postman problem
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
- A cutting plane algorithm for the windy 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)
