Newsgroups: comp.ai.neural-nets
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!news.duke.edu!godot.cc.duq.edu!newsfeed.pitt.edu!gatech!swrinde!howland.reston.ans.net!news.sprintlink.net!redstone.interpath.net!sas!mozart.unx.sas.com!saswss
From: saswss@hotellng.unx.sas.com (Warren Sarle)
Subject: Re: TABU Search
Originator: saswss@hotellng.unx.sas.com
Sender: news@unx.sas.com (Noter of Newsworthy Events)
Message-ID: <D3p6MA.JGL@unx.sas.com>
Date: Wed, 8 Feb 1995 20:08:34 GMT
References:  <3hauv7$k2e@mercury.kingston.ac.uk>
Nntp-Posting-Host: hotellng.unx.sas.com
Organization: SAS Institute Inc.
Lines: 17


In article <3hauv7$k2e@mercury.kingston.ac.uk>, bs_s511@kingston.ac.uk (Ara Yeghiazarian) writes:
|> Could any one can give me pointer/reference about TABU search please.

Reeves, C.R., ed. (1993) _Modern Heuristic Techniques for Combinatorial
Problems_, NY: Wiley.

|> Perhaps I need to look under Linear Programing!?

More likely integer programming or combinatorial optimization.


-- 

Warren S. Sarle       SAS Institute Inc.   The opinions expressed here
saswss@unx.sas.com    SAS Campus Drive     are mine and not necessarily
(919) 677-8000        Cary, NC 27513, USA  those of SAS Institute.
