Puzzle—Brushing the Court Lines Optimally

Published Online:https://doi.org/10.1287/ited.2015.0150

References

  • Edmonds J, Johnson E (1973) Matching, euler tours, and the chinese postman. Math. Programming 5(1):88–124.CrossrefGoogle Scholar
  • Eiselt H, Gendreau M, LaPorte G (1995) Arc routing problems, Part II: The rural postman problem. Oper. Res. 43(3):399–414.LinkGoogle Scholar
  • Lenstra JK, Rinnooy Kan A (1976) On general routing problems. Networks 6(3):273–280.CrossrefGoogle Scholar
  • Polya G (1945) How to Solve It (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.