{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T19:13:25Z","timestamp":1722626005062},"reference-count":15,"publisher":"MIT Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Computation"],"published-print":{"date-parts":[[2002,2,1]]},"abstract":"<jats:p>A Lagrange multiplier and Hopfield-type barrier function method is proposed for approximating a solution of the traveling salesman problem. The method is derived from applications of Lagrange multipliers and a Hopfield-type barrier function and attempts to produce a solution of high quality by generating a minimum point of a barrier problem for a sequence of descending values of the barrier parameter. For any given value of the barrier parameter, the method searches for a minimum point of the barrier problem in a feasible descent direction, which has a desired property that lower and upper bounds on variables are always satisfied automatically if the step length is a number between zero and one. At each iteration, the feasible descent direction is found by updating Lagrange multipliers with a globally convergent iterative procedure. For any given value of the barrier parameter, the method converges to a stationary point of the barrier problem without any condition on the objective function. Theoretical and numerical results show that the method seems more effective and efficient than the softassign algorithm.<\/jats:p>","DOI":"10.1162\/08997660252741130","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:56:30Z","timestamp":1027770990000},"page":"303-324","source":"Crossref","is-referenced-by-count":10,"title":["A Lagrange Multiplier and Hopfield-Type Barrier Function Method for the Traveling Salesman Problem"],"prefix":"10.1162","volume":"14","author":[{"given":"Chuangyin","family":"Dang","sequence":"first","affiliation":[{"name":"Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, Kowloon, Hong Kong,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Chinese University of Hong Kong, New Territories, Hong Kong,"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"281","reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1109\/72.80232"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1038\/326689a0"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(05)80074-7"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1994.6.1.161"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.81.10.3088"},{"key":"p_9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"Hopfield J.","year":"1985","journal-title":"Biological Cybernetics"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1142\/S0129065789000414"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1996.8.5.1041"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016313"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1088\/0954-898X_1_1_007"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1996.8.5.1061"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1109\/72.80231"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1007\/BF00204755"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.47.4524"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1994.6.3.341"}],"container-title":["Neural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/08997660252741130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,23]],"date-time":"2023-04-23T19:46:57Z","timestamp":1682279217000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/neco\/article\/14\/2\/303-324\/6580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2,1]]}},"alternative-id":["10.1162\/08997660252741130"],"URL":"https:\/\/doi.org\/10.1162\/08997660252741130","relation":{},"ISSN":["0899-7667","1530-888X"],"issn-type":[{"value":"0899-7667","type":"print"},{"value":"1530-888X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,2,1]]}}}