The Online TSP Against Fair Adversaries

@article{Blom2001TheOT,
  title={The Online TSP Against Fair Adversaries},
  author={Michiel Blom and Sven Oliver Krumke and Willem de Paepe and Leen Stougie},
  journal={INFORMS Journal on Computing},
  year={2001},
  volume={13},
  pages={138-148}
}
3 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Online diala - ride problems : Minimizing the ompletion time

  • S. O. Krumke, J. Rambau
  • 2000

Algorithms forthe on - line traveling salesman

  • E. Feuerstein G. Ausiello, S. Leonardi, L. Stougie, M. Talamo
  • 1999

The online traveling salesman problem on the line

  • M. Lipmann
  • Master's thesis, Department of Operations Resear…
  • 1999
2 Excerpts

Online Algorithms: The State of the Art, volume

  • A. Fiat, G. J. Woeginger, editors
  • Le ture Notes in Computer S ien e. Springer,
  • 1998
2 Excerpts

On-line s heduling of two-ma hine open shops where jobs arrive over time

  • B. Chen, A.P.A. Vestjens, G. J. Woeginger
  • Journal of Combinatorial Optimization,
  • 1997
1 Excerpt

Minimizing average ompletion time in the presen e of release dates

  • C. Philips, C. Stein, J. Wein
  • In Pro eedings of the 4th Workshop on Algorithms…
  • 1995
2 Excerpts

Performan e analysis of heterogenous multi - pro essor omputing systems

  • R. Mahl
  • Computer Ar hite - tures and Networks

Similar Papers

Loading similar papers…