{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T18:02:31Z","timestamp":1750528951496},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1109\/iscc.2009.5202308","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:08:22Z","timestamp":1251126502000},"page":"461-467","source":"Crossref","is-referenced-by-count":2,"title":["A Tabu Search heuristic for capacitated network design"],"prefix":"10.1109","author":[{"given":"Mohamed Zied","family":"Ben Hamouda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Brun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marie","family":"Garcia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Network Design and Transportation Planning Models and Algorithms","year":"1984","author":"magnanti","key":"17"},{"journal-title":"Modeling and Solving the Two-Facility Capacitated Network Loading Problem","year":"1995","author":"magnanti","key":"15"},{"journal-title":"Modeling and Solving the Capacitated Network Loading Problem","year":"1991","author":"magnanti","key":"16"},{"journal-title":"Shortest Paths Single Origin-Destination Network Design and Associated Polyhedra","year":"1993","author":"magnanti","key":"13"},{"journal-title":"The Convex Hull ofTwo Core Capacitated Network Design Problems","year":"1993","author":"magnanti","key":"14"},{"journal-title":"Network Synthesis and Optimum Network Design Problems Models Solution Methods and Applications","year":"1989","author":"minoux","key":"11"},{"key":"12","article-title":"capacitated topology design with equipmentdependent costs","author":"ben hamouda","year":"2009","journal-title":"LAAS-CNRS Internal Report"},{"journal-title":"Solving the Two-Connected Network with Bounded Meshes Problem","year":"2000","author":"fortz","key":"3"},{"journal-title":"0-1 Reformulations of the Multicommodity Capacitated Network Design Problem","year":"2008","author":"frangioni","key":"2"},{"journal-title":"A Dual-Ascent Procedure for LargeScale Uncapacitated Network Design","year":"1989","author":"balakrishnan","key":"1"},{"key":"10","article-title":"tabu search and adaptive memory programming advances, applications and challenges","author":"glover","year":"1997","journal-title":"Advances in Metaheuristics Optimization and Stochastic Modeling Technologies"},{"journal-title":"Network Design Using Cut Inequalities","year":"1996","author":"barahona","key":"7"},{"journal-title":"Capacitated Network Design-Polyhedral Structure and Computation","year":"1996","author":"bienstock","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5087-7_1"},{"journal-title":"Backbone Network Design Tools with Economic Tradeoffs","year":"1990","author":"gavish","key":"4"},{"journal-title":"Tabu Search-Part II","year":"1990","author":"glover","key":"9"},{"journal-title":"Tabu Search-Part I","year":"1989","author":"glover","key":"8"}],"event":{"name":"2009 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2009,7,5]]},"location":"Sousse, Tunisia","end":{"date-parts":[[2009,7,8]]}},"container-title":["2009 IEEE Symposium on Computers and Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179146\/5202209\/05202308.pdf?arnumber=5202308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T04:57:47Z","timestamp":1489813067000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5202308\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/iscc.2009.5202308","relation":{},"subject":[],"published":{"date-parts":[[2009,7]]}}}