OAR lib: an open source arc routing library
From MaRDI portal
Publication:2293658
Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cites work
- A computational study of several heuristics for the DRPP
- A cutting plane algorithm for the windy postman problem
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A heuristic algorithm for the mixed Chinese postman problem
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
- A library of local search heuristics for the vehicle routing problem
- A note on two problems in connexion with graphs
- A simple and efficient tabu search heuristic for solving the open vehicle routing problem
- Approximation Algorithms for Some Postman Problems
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- scientific article; zbMATH DE number 1947382 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- Matching, Euler tours and the Chinese postman
- New heuristic algorithms for the windy rural postman problem
- Odd Minimum Cut-Sets and b-Matchings
- On the windy postman problem on Eulerian graphs
- Plowing with precedence: a variant of the windy postman problem
Cited in
(3)
Describes a project that uses
Uses Software
This page was built for publication: OAR lib: an open source arc routing library
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2293658)