Draft:Chinese Postman Problem

Draft article not currently submitted for review.

This is a draft Articles for creation (AfC) submission. It is not currently pending review. While there are no deadlines, abandoned drafts may be deleted after six months. To edit the draft click on the "Edit" tab at the top of the window.

To be accepted, a draft should:

Show the subject qualifies for a Wikipedia article by using multiple sources that meet four criteria. The sources should be (1) reliable (2) secondary (3) independent of the subject (4) talk about the subject in some depth. For some topics, there are alternative criteria.
Be written from a neutral point of view
Respect copyright and do not plagiarize. Do not copy-paste.

It is strongly discouraged to write about yourself, your business or employer. If you do so, you must declare it.

This draft has not been edited in over six months and qualifies to be deleted per CSD G13.

Where to get help

If you need help editing or submitting your draft, please ask us a question at the AfC Help Desk or get live help from experienced editors. These venues are only for help with editing and the submission process, not to get reviews.
If you need feedback on your draft, or if the review is taking a lot of time, you can try asking for help on the talk page of a relevant WikiProject. Some WikiProjects are more active than others so a speedy reply is not guaranteed.

How to improve a draft

Wikipedia:Contributing to Wikipedia – a basic overview on how to edit Wikipedia.
Help:Wikitext – how to use the markup
Help:Referencing for beginners – how to include references
Wikipedia:Article development – how to develop your article
Wikipedia:Writing better articles – how to improve your article
Wikipedia:Verifiability – make sure your article includes reliable third-party sources

You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article.

Improving your odds of a speedy review

To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags.

Add tags to your draft

Editor resources

Easy tools: Citation bot (help) | Advanced: Fix bare URLs

Last edited by WalkingRadiance (talk | contribs) 2 years ago. (Update)

Submit the draft for review!

The Chinese Postman problem (CPP) relates to a graph G with vertices V and edges E. The graph G should be finite, undirected, and connected. The edges are often assigned a finite real-valued weight that is not negative. The Chinese Postman Problem has been proven to be reducible in polynomial time, in constrast to the Mixed Chinese Postman Problem (MCPP) which is NP complete.^[1]

The CPP forms the basis of the field of arc routing compared to more complex cases including the MCPP, the directed chinese postman problem DCPP, the windy postman problem WPP, the rural postman problem RPP, and the hierarchical chinese postman problem HCPP.^[2]

References

^ Haouari, Mohumed (March 2002). "Arc Routing: Theory, Solutions and Applications Moshe Dror (editor) Kluwer Academic Publishers, 2000, ISBN 0-792-37898-9". IIE Transactions. 34 (3): 331–332. doi:10.1080/07408170208936917. ISSN 0740-817X.
^ Hrsg., Corberán, Ángel (2015). Arc routing : problems, methods, and applications. SIAM. ISBN 978-1-61197-366-2. OCLC 904346272.{{cite book}}: CS1 maint: multiple names: authors list (link)

[1] Haouari, Mohumed (March 2002). "Arc Routing: Theory, Solutions and Applications Moshe Dror (editor) Kluwer Academic Publishers, 2000, ISBN 0-792-37898-9". IIE Transactions. 34 (3): 331–332. doi:10.1080/07408170208936917. ISSN 0740-817X.

[2] Hrsg., Corberán, Ángel (2015). Arc routing : problems, methods, and applications. SIAM. ISBN 978-1-61197-366-2. OCLC 904346272.{{cite book}}: CS1 maint: multiple names: authors list (link)

[1]

[2]