Skip to main content
Article thumbnail
Location of Repository

Greedy Like Algorithms for the Traveling Salesman and Multidimensional Assignment Problems

By Gregory Gutin and Daniel Karapetyan

Abstract

Majority of chapters of this book show usefulness of greedy like algorithms for solving various combinatorial optimization problems. The aim of this chapter is to warn the reader that not always a greedy like approach is a good option and, in certain cases, it is a very bad option being sometimes among the worst possibl

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.370.8724
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://eprints.pascal-network.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.