On the public citation graph
An optimal method for the mixed postman problem
0 signed · 41 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.1007/978-3-540-68279-0_9openalex-snapshot
Lagrangian Relaxation for Integer Programming
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bfb0120690openalex-snapshot
Lagrangean relaxation for integer programming
inferredcites →https://doi.org/10.1016/0166-218x(79)90016-7openalex-snapshot
The mixed postman problem
inferredcites →https://doi.org/10.1057/jors.1980.31openalex-snapshot
Optimization Algorithms for Networks and Graphs
inferredcites →https://doi.org/10.1145/321958.321974openalex-snapshot
On the complexity of edge traversing
inferredcites →https://doi.org/10.1145/322139.322150openalex-snapshot
Approximation Algorithms for Some Postman Problems
inferredcites →https://doi.org/10.1287/mnsc.25.7.643openalex-snapshot
The Chinese Postman Problem for Mixed Networks
inferredcites →https://doi.org/10.2307/2153592openalex-snapshot
Optimization Algorithms for Networks and Graphs.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_13openalex-snapshot
Approximation Algorithms for the Mixed Postman Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_1openalex-snapshot
A Historical Perspective on Arc Routing
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/bf01581206openalex-snapshot
A cutting plane algorithm for the windy postman problem
inferred← citeshttps://doi.org/10.1007/bf02574736openalex-snapshot
ARC A computerized system for urban garbage collection
inferred← citeshttps://doi.org/10.1007/s00521-023-09195-4openalex-snapshot
Ant colony optimization for Chinese postman problem
inferred← citeshttps://doi.org/10.1007/s00521-024-10052-1openalex-snapshot
Ant Colony Optimization for solving Directed Chinese Postman 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.1016/0305-0548(94)00036-8openalex-snapshot
Algorithms for the Chinese postman problem on mixed networks
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90079-5openalex-snapshot
Algorithms for the Windy 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.ejor.2014.04.039openalex-snapshot
Approximation algorithms for solving the constrained arc routing problem in mixed graphs
inferred← citeshttps://doi.org/10.1016/s0305-0548(00)00091-5openalex-snapshot
The Rural Postman Problem on mixed graphs with turn penalties
inferred← citeshttps://doi.org/10.1016/s0305-0548(98)00092-6openalex-snapshot
Improved solutions for the Chinese postman problem on mixed networks
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.1023/a:1020915403051openalex-snapshot
A Heuristic Algorithm for the Mixed Chinese Postman Problem
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.14295/transportes.v22i1.705openalex-snapshot
Heurística para solução do problema da coleta de resíduos sólidos domiciliares (RSD) com base no problema do carteiro chinês capacitado com múltiplas viagens (PCCC-MV)
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.5859/kais.2008.17.3.039openalex-snapshot
GENIIS, a New Hybrid Algorithm for Solving the Mixed Chinese Postman Problem
inferred← citeshttps://doi.org/10.70675/b6a1bb04z1604z4068z8a78zdade510ea6f6openalex-snapshot
Contribution aux graphes creux pour le problème de tournées sur arcs déterministe et robustes : théorie et algorithmes
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.