{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T07:10:10Z","timestamp":1700205010739},"reference-count":37,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2004,5,25]],"date-time":"2004-05-25T00:00:00Z","timestamp":1085443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2004,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This report highlights some recent contributions to network optimization based on papers presented at the first International Network Optimization Conference (INOC'2003) held in Evry\u2010Paris, France. \u00a9 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(1), 27\u201330 2004<\/jats:p>","DOI":"10.1002\/net.20010","type":"journal-article","created":{"date-parts":[[2004,5,25]],"date-time":"2004-05-25T20:00:55Z","timestamp":1085515255000},"page":"27-30","source":"Crossref","is-referenced-by-count":3,"title":["Some recent contributions to network optimization"],"prefix":"10.1002","volume":"44","author":[{"given":"Walid","family":"Ben\u2010Ameur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Gouveia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2004,5,26]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"M.AbbasandZ.Benmeziane Partly claw\u2010free graphs."},{"key":"e_1_2_1_3_2","unstructured":"J.Alber N.Betzler andR.Niedermeier Experiments on data reduction for optimal domination in networks."},{"key":"e_1_2_1_4_2","unstructured":"F.AlvelosandJ.M.V.de Carvalho Comparing branch\u2010and\u2010price algorithms for the unsplittable multicommodity flow problem."},{"key":"e_1_2_1_5_2","unstructured":"P.Avella M.Boccia R.Canonico D.Emma A.Sforza andG.Ventre Web cache location and network design in VPNs."},{"key":"e_1_2_1_6_2","unstructured":"F.Barahona Separation of partition inequalities and their role in network design."},{"key":"e_1_2_1_7_2","unstructured":"M.BelaidouniandW.Ben\u2010Ameur A superadditive approach to solve the minimum cost single path routing problem: preliminary results."},{"key":"e_1_2_1_8_2","unstructured":"P.BelottiandF.Malucelli A Lagrangian relaxation approach for the design of networks with shared protection."},{"key":"e_1_2_1_9_2","unstructured":"W.Ben\u2010AmeurandH.Kerivin A polyhedral model to deal with uncertainty."},{"key":"e_1_2_1_10_2","unstructured":"A.Bley A Lagrangian approach for integrated network configuration and routing planning in IP networks."},{"key":"e_1_2_1_11_2","unstructured":"N.Bourquia W.Ben\u2010Ameur andE.Gourdin Optimal shortest path routing for Internet networks."},{"key":"e_1_2_1_12_2","unstructured":"P.Burgos H.Cancela A.Godoy andL.Petingi Network reliability optimization with source\u2010terminal distance constraints."},{"key":"e_1_2_1_13_2","unstructured":"C.Chekuri W.Lee andL.Zhang Optical line system configuration via dynamic programming."},{"key":"e_1_2_1_14_2","unstructured":"G.DahlandN.Foldnes A randomized algorithm for the multiple knapsack problem with assignment restrictions."},{"key":"e_1_2_1_15_2","unstructured":"A.Farago Route metrics: diversity and unification."},{"key":"e_1_2_1_16_2","unstructured":"B.FortzandM.Thorup Robust optimization of OSPF\/IS\u2010IS weights."},{"key":"e_1_2_1_17_2","unstructured":"R.Fukasawa M.Poggi de Arago O.Porto andE.Uchoa Robust branch\u2010and\u2010cut\u2010and\u2010price for the capacitated minimum spanning tree problem."},{"key":"e_1_2_1_18_2","unstructured":"H.GeerdesandH.Karl The potential of relaying in cellular networks."},{"key":"e_1_2_1_19_2","unstructured":"T.GomesandJ.Craveirinha An algorithm for obtaining the most reliable pair of link disjoint paths with length constraints."},{"key":"e_1_2_1_20_2","unstructured":"L.Gouveia T.L.Magnanti andC.Requejo An intersecting tree model for odd\u2010diameter\u2010constrained minimum spanning and Steiner trees."},{"key":"e_1_2_1_21_2","unstructured":"K.R.HutsonandD.R.Shier Algorithms for the weight distribution of a minimum spanning tree in a stochastic network."},{"key":"e_1_2_1_22_2","unstructured":"T.Koide S.Shinmori andH.Ishii Reliability importance computation on all components in a network system."},{"key":"e_1_2_1_23_2","unstructured":"H.Koskinen A simulation\u2010based method for predicting connectivity in ad hoc networks."},{"key":"e_1_2_1_24_2","unstructured":"A.Kr\u00f6llerandR.Wess\u00e4ly Integrated optimization of hardware configuration and capacity dimensioning in SDH and opaque WDM networks."},{"key":"e_1_2_1_25_2","unstructured":"B.Lardeux A.Knippel andJ.Geffard Efficient algorithms for solving the 2\u2010layered network design problem."},{"key":"e_1_2_1_26_2","unstructured":"A.LaugierandS.Petat Network design and b\u2010matching."},{"key":"e_1_2_1_27_2","unstructured":"A.R.Mahjoub Design of survivable networks."},{"key":"e_1_2_1_28_2","unstructured":"M.Minoux Discrete cost network optimization models and solution algorithm."},{"key":"e_1_2_1_29_2","unstructured":"E.Monakhova Optimal triple loop networks with given transmission delay: topological design and routing."},{"key":"e_1_2_1_30_2","unstructured":"E.MulyanaandU.Killat An offline hybrid IGP\/MPLS traffic engineering approach under LSP constraints."},{"key":"e_1_2_1_31_2","unstructured":"D.NaceandL.N.Doan Some results on max\u2010min fair routing."},{"key":"e_1_2_1_32_2","unstructured":"S.Park D.Kim andK.Lee Integer programming approach to the path selection problems."},{"key":"e_1_2_1_33_2","unstructured":"M.P\u00e9rez F.Almeida andJ.M.Vega Path relinking for the p\u2010hub median problem."},{"key":"e_1_2_1_34_2","unstructured":"A.Quilliot F.Mailfert andJ.Mailfert Cooperative game models for pricing networks with elastic demands."},{"key":"e_1_2_1_35_2","unstructured":"I.Rodr\u00edguezandJ.Salazar An exact algorithm for a capacitated hub problem."},{"key":"e_1_2_1_36_2","unstructured":"H.Sakurai S.Kasahara andN.Adachi Internet pricing and user opt\u2010out strategy under two ISPs competition."},{"key":"e_1_2_1_37_2","unstructured":"M.G.Scutella A note on the parametric maximum flow problem and some related reoptimization issues."},{"key":"e_1_2_1_38_2","unstructured":"Q.P.Thai T.Q.Nguyen andJ.\u2010L.Lutton On solving network tariff\u2010setting problem by D.C. programming approach."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20010","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.20010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T06:50:47Z","timestamp":1700203847000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/net.20010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5,26]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,8]]}},"alternative-id":["10.1002\/net.20010"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/net.20010","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,5,26]]}}}