On the public citation graph
A cutting plane algorithm for the windy postman problem
0 signed · 66 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9781119584445.ch10openalex-snapshot
The Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-3-642-51576-7_6openalex-snapshot
The Chinese Postman Problem
inferredcites →https://doi.org/10.1007/978-3-642-61649-5_4openalex-snapshot
Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-642-95161-9openalex-snapshot
Graphentheorie in Planungs- und Tourenproblemen
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf01584376openalex-snapshot
Solving matching problems with linear programming
inferredcites →https://doi.org/10.1007/bf01586932openalex-snapshot
Solution of large-scale symmetric travelling salesman problems
inferredcites →https://doi.org/10.1007/bf01587080openalex-snapshot
On the Windy Postman Problem on eulerian graphs
inferredcites →https://doi.org/10.1007/bf01589097openalex-snapshot
A cutting plane algorithm for a clustering problem
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bfb0008937openalex-snapshot
An optimal method for the mixed postman problem
inferredcites →https://doi.org/10.1016/0166-218x(84)90089-1openalex-snapshot
On the windy postman problem
inferredcites →https://doi.org/10.1057/jors.1983.14openalex-snapshot
Modern Applied Mathematics: Optimization and Operations Research
inferredcites →https://doi.org/10.1137/1033004openalex-snapshot
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1145/321958.321974openalex-snapshot
On the complexity of edge traversing
inferredcites →https://doi.org/10.1145/355972.355976openalex-snapshot
The Design of the XMP Linear Programming Library
inferredcites →https://doi.org/10.1287/moor.7.1.67openalex-snapshot
Odd Minimum Cut-Sets and b -Matchings
inferredcites →https://doi.org/10.1287/opre.32.6.1195openalex-snapshot
A Cutting Plane Algorithm for the Linear Ordering Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0142openalex-snapshot
C hinese Postman Problem
inferred← citeshttps://doi.org/10.1002/net.20176openalex-snapshot
A branch & cut algorithm for the windy general routing problem and special cases
inferred← citeshttps://doi.org/10.1002/net.20347openalex-snapshot
Recent results on Arc Routing Problems: An annotated bibliography
inferred← citeshttps://doi.org/10.1002/net.21987openalex-snapshot
Plowing with precedence in polynomial time
inferred← citeshttps://doi.org/10.1007/0-387-32942-0_6openalex-snapshot
Modeling and Optimization of Vehicle Routing and Arc Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_5openalex-snapshot
Chinese Postman and Euler Tour Problems in Bi-Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_6openalex-snapshot
Polyhedral Theory for Arc Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_7openalex-snapshot
Linear Programming Based Methods for Solving Arc Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_37openalex-snapshot
An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times
inferred← citeshttps://doi.org/10.1007/978-3-642-76119-5_55openalex-snapshot
Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme
inferred← citeshttps://doi.org/10.1007/pl00011426openalex-snapshot
A cutting plane algorithm for the General Routing Problem
inferred← citeshttps://doi.org/10.1007/s10107-003-0391-9openalex-snapshot
The mixed general routing polyhedron
inferred← citeshttps://doi.org/10.1007/s10107-005-0643-yopenalex-snapshot
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems
inferred← citeshttps://doi.org/10.1007/s10107-010-0399-xopenalex-snapshot
New results on the Windy Postman Problem
inferred← citeshttps://doi.org/10.1007/s10878-014-9755-8openalex-snapshot
An integer programming approach for the Chinese postman problem with time-dependent travel time
inferred← citeshttps://doi.org/10.1007/s12532-019-00155-5openalex-snapshot
OAR Lib: an open source arc routing library
inferred← citeshttps://doi.org/10.1016/j.cor.2004.04.007openalex-snapshot
New heuristic algorithms for the windy rural postman problem
inferred← citeshttps://doi.org/10.1016/j.cor.2005.02.010openalex-snapshot
A comparison of two different formulations for arc routing problems on mixed graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107327openalex-snapshot
Time-dependent Windy Rural Postman Problem: Mathematical formulation and adaptive metaheuristic
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.062openalex-snapshot
Series–parallel graphs are windy postman perfect
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.09.021openalex-snapshot
Lower bounds and heuristics for the Windy Rural Postman Problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00296-xopenalex-snapshot
A GRASP heuristic for the mixed Chinese postman problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80109-4openalex-snapshot
Chapter 5 Arc routing methods and applications
inferred← citeshttps://doi.org/10.1023/a:1018350224084openalex-snapshot
Finding Postal Carrier Walk Paths in Mixed Graphs
inferred← citeshttps://doi.org/10.1023/a:1020915403051openalex-snapshot
A Heuristic Algorithm for the Mixed Chinese Postman Problem
inferred← citeshttps://doi.org/10.1051/ro/2012004openalex-snapshot
A branch-and-price algorithm for the windy rural postman problem
inferred← citeshttps://doi.org/10.1080/10556788.2012.666240openalex-snapshot
The time-dependent rural postman problem: polyhedral results
inferred← citeshttps://doi.org/10.1109/cso.2011.104openalex-snapshot
Column Generation Approach for the Time Dependent Chinese Postman Problem
inferred← citeshttps://doi.org/10.1111/1467-9574.00104openalex-snapshot
Polyhedral techniques in combinatorial optimization II: applications and computations
inferred← citeshttps://doi.org/10.1137/050640886openalex-snapshot
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
inferred← citeshttps://doi.org/10.1287/opre.1040.0168openalex-snapshot
New Results on the Mixed General Routing Problem
inferred← citeshttps://doi.org/10.14393/ufu.di.2022.550openalex-snapshot
Otimização logística da poluição de rotas de veículos no transporte de resíduos sólidos urbanos
inferred← citeshttps://doi.org/10.1504/ijlsm.2010.035038openalex-snapshot
Chinese Postman Problem (CPP): solution methods and computational time
inferred← citeshttps://doi.org/10.15517/rmta.v19i2.1334openalex-snapshot
Variants of the mixed postman problem solvable using linear programming
inferred← citeshttps://doi.org/10.1590/s0101-74382009000200005openalex-snapshot
O problema do carteiro chinês, algoritmos exatos e um ambiente MVI para análise de suas instâncias: sistema XNÊS
inferred← citeshttps://doi.org/10.1590/s0103-65132006000300014openalex-snapshot
Problema do carteiro chinês: escolha de métodos de solução e análise de tempos computacionais
inferred← citeshttps://doi.org/10.22034/2015.4.03openalex-snapshot
Capacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm
inferred← citeshttps://doi.org/10.26481/umamet.1995014openalex-snapshot
Polyhedral Techniques in Combinatorial Optimization
inferred← citeshttps://doi.org/10.46298/dmtcs.3396openalex-snapshot
The Windy Postman Problem on Series-Parallel Graphs
inferred← citeshttps://doi.org/10.5335/rbca.v12i1.9317openalex-snapshot
Roteirization of vehicles in the delivery/collection problems - Application of a modifed Ant Colony Algorithm
inferred← citeshttps://doi.org/10.5859/kais.2008.17.3.039openalex-snapshot
GENIIS, a New Hybrid Algorithm for Solving the Mixed Chinese Postman Problem
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.