Approximate Local Search in Combinatorial Optimization

dc.creator	Orlin, James
dc.creator	Punnen, Abraham
dc.creator	Schulz, Andreas
dc.date	2004-12-10T19:17:17Z
dc.date	2004-12-10T19:17:17Z
dc.date	2004-12-10T19:17:17Z
dc.date.accessioned	2013-10-09T02:39:49Z
dc.date.available	2013-10-09T02:39:49Z
dc.date.issued	2013-10-09
dc.identifier	http://hdl.handle.net/1721.1/7407
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	Local search algorithms for combinational optimization problems are in general of pseudopolynomial running time and polynomial-time algorithms are often not known for finding locally optimal solutions for NP-hard optimization problems. We introduce the concept of
dc.format	302104 bytes
dc.format	application/pdf
dc.language	en_US
dc.relation	MIT Sloan School of Management Working Paper;4325-03
dc.title	Approximate Local Search in Combinatorial Optimization
dc.type	Working Paper

Files in this item

Files	Size	Format	View
There are no files associated with this item.