{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:26:36Z","timestamp":1761596796620,"version":"3.43.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1023\/a:1019148207669","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"269-291","source":"Crossref","is-referenced-by-count":34,"title":["Some approaches to solving a multihour broadband network capacity design problem with single-path routing"],"prefix":"10.1007","volume":"13","author":[{"given":"D.","family":"Medhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Tipper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"329784_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/ijoc.6.2.161","volume":"6","author":"E.J. Anderson","year":"1994","unstructured":"E.J. Anderson and M.C. Ferris, Genetic algorithms for combinatorial optimization: The assembly line balancing problem, ORSA Journal on Computing 6 (1994) 161\u2013173.","journal-title":"ORSA Journal on Computing"},{"key":"329784_CR2","doi-asserted-by":"crossref","unstructured":"A. Arvidsson, Management of reconfigurable virtual path networks, in: Proc. of the 14th Internat. Teletraffic Congress, Antibes, France (June 1994) pp. 931\u2013940.","DOI":"10.1016\/B978-0-444-82031-0.50096-2"},{"issue":"8","key":"329784_CR3","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1002\/j.1538-7305.1981.tb00297.x","volume":"60","author":"G.R. Ash","year":"1981","unstructured":"G.R. Ash, R.H. Cardwell and R.P. Murray, Design and optimization of networks with dynamic routing, Bell Systems Technical Journal 60(8) (1981) 1787\u20131820.","journal-title":"Bell Systems Technical Journal"},{"key":"329784_CR4","doi-asserted-by":"crossref","first-page":"1821","DOI":"10.1002\/j.1538-7305.1981.tb00298.x","volume":"60","author":"G.R. Ash","year":"1981","unstructured":"G.R. Ash, A.H. Kafker and K.R. Krishnan, Servicing and real-time control of networks with dynamic routing, Bell Systems Technical Journal 60 (1981) 1821\u20131845.","journal-title":"Bell Systems Technical Journal"},{"key":"329784_CR5","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"D. Bertsekas and R. Gallager, Data Networks, 2nd ed. (Prentice-Hall, Englewood Cliffs, NJ, 1992).","edition":"2nd ed."},{"key":"329784_CR6","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D. Bertsekas","year":"1989","unstructured":"D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods (Prentice-Hall, Englewood Cliffs, NJ, 1989)."},{"key":"329784_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0169-7552(90)90041-P","volume":"20","author":"J. Burgin","year":"1990","unstructured":"J. Burgin, Broadband ISDN resource management, Computer Networks & ISDN Systems 20 (1990) 323\u2013331.","journal-title":"Computer Networks & ISDN Systems"},{"key":"329784_CR8","unstructured":"CPLEX linear optimizer 4.0.3 with mixed integer solver; available at: www.cplex.com."},{"key":"329784_CR9","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/trsc.5.4.366","volume":"5","author":"S.C. Dafermos","year":"1971","unstructured":"S.C. Dafermos, An extended traffic assignment model with application to two-way traffic, Transportation Science 5 (1971) 366\u2013389.","journal-title":"Transportation Science"},{"key":"329784_CR10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0120941","volume":"15","author":"R. Dembo","year":"1981","unstructured":"R. Dembo and J. Klincewicz, A scaled reduced gradient algorithm for network flow problems with convex separable costs, Mathematical Programming Study 15 (1981) 125\u2013147.","journal-title":"Mathematical Programming Study"},{"issue":"2","key":"329784_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/65.124611","volume":"6","author":"M. De Prycker","year":"1992","unstructured":"M. De Prycker, ATM switching on demand, IEEE Network 6(2) (1992) 25\u201328.","journal-title":"IEEE Network"},{"key":"329784_CR12","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1109\/26.297842","volume":"42","author":"A. Dutta","year":"1994","unstructured":"A. Dutta, Capacity planning of private networks using dcs under multibusy-hour traffic, IEEE Transactions on Communications 42 (1994) 2371\u20132374.","journal-title":"IEEE Transactions on Communications"},{"key":"329784_CR13","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1287\/opre.40.4.689","volume":"40","author":"A. Dutta","year":"1992","unstructured":"A. Dutta and J.-I. Lim, A multi-period capacity planning model for backbone computer communication networks, Operations Research 40 (1992) 689\u2013705.","journal-title":"Operations Research"},{"key":"329784_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1977.tb00150.x","volume":"56","author":"M. Eisenberg","year":"1977","unstructured":"M. Eisenberg, Engineering traffic networks for more than one busy hour, Bell Systems Technical Journal 56 (1977) 1\u201320.","journal-title":"Bell Systems Technical Journal"},{"key":"329784_CR15","doi-asserted-by":"crossref","unstructured":"R. Elbaum and M. Sidi, Topological design of local area networks using genetic algorithms, in: Proc. of IEEE Conf. on Computer Communications (INFOCOM'95), Boston, MA (April 1995) pp. 64\u201371.","DOI":"10.1109\/INFCOM.1995.515861"},{"key":"329784_CR16","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1002\/j.1538-7305.1977.tb00569.x","volume":"56","author":"W.B. Elsner","year":"1977","unstructured":"W.B. Elsner, A descent algorithm for the multihour sizing of traffic networks, Bell Systems Technical Journal 56 (1977) 1405\u20131429.","journal-title":"Bell Systems Technical Journal"},{"key":"329784_CR17","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1287\/opre.41.4.669","volume":"41","author":"J.M. Farvolden","year":"1993","unstructured":"J.M. Farvolden, W.B. Powell and I.J. Lustig, A primal partitioning solution for the arc-chain formulation of a multi-commodity network flow problem, Operations Research 41 (1993) 669\u2013693.","journal-title":"Operations Research"},{"key":"329784_CR18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/trsc.8.4.321","volume":"8","author":"M. Florian","year":"1974","unstructured":"M. Florian and S. Nguyen, A Method for computing network equilibrium with elastic demand, Transportation Science 8 (1974) 321\u2013332.","journal-title":"Transportation Science"},{"key":"329784_CR19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","volume":"3","author":"L. Fratta","year":"1973","unstructured":"L. Fratta, M. Gerla and L. Kleinrock, The flow deviation method: An approach to store-and-forward computer communication network design, Networks 3 (1973) 97\u2013133.","journal-title":"Networks"},{"key":"329784_CR20","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1109\/TCOM.1983.1095752","volume":"31","author":"B. Gavish","year":"1983","unstructured":"B. Gavish and S. Hantler, An algorithm for optimal route selection in SNA networks, IEEE Transactions on Communications 31 (1983) 1154\u20131161.","journal-title":"IEEE Transactions on Communications"},{"key":"329784_CR21","unstructured":"B. Gavish and I. Newman, Capacity and flow assignment in large computer networks, in: Proc. of IEEE INFOCOM'86 (1986) pp. 275\u2013284."},{"key":"329784_CR22","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/26.20116","volume":"37","author":"B. Gavish","year":"1989","unstructured":"B. Gavish and I. Neumann, A system for routing and capacity assignment in computer communications networks, IEEE Transactions on Communications 37 (1989) 360\u2013366.","journal-title":"IEEE Transactions on Communications"},{"key":"329784_CR23","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1109\/26.153370","volume":"40","author":"B. Gavish","year":"1992","unstructured":"B. Gavish and I. Newman, Routing in a network with unreliable components, IEEE Transactions on Communications 40 (1992) 1249\u20131258.","journal-title":"IEEE Transactions on Communications"},{"key":"329784_CR24","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1109\/49.35570","volume":"7","author":"M. Gerla","year":"1989","unstructured":"M. Gerla, J.A. Suruagy Monteiro and R. Pazos, Topology design and bandwidth allocation in ATM nets, Journal on Selected Areas in Communications 7 (1989) 1253\u20131262.","journal-title":"Journal on Selected Areas in Communications"},{"key":"329784_CR25","volume-title":"Routing and Dimensioning in Circuit-Switched Networks","author":"A. Girard","year":"1990","unstructured":"A. Girard, Routing and Dimensioning in Circuit-Switched Networks (Addison-Wesley, Reading, MA, 1990)."},{"key":"329784_CR26","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, Reading, MA, 1989)."},{"key":"329784_CR27","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/0328029","volume":"28","author":"C.D. Ha","year":"1990","unstructured":"C.D. Ha, A generalization of the proximal point algorithm, SIAM Journal of Control and Optimization 28 (1990) 503\u2013512.","journal-title":"SIAM Journal of Control and Optimization"},{"key":"329784_CR28","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"M. Held, P. Wolfe and H. Crowder, Validation of subgradient optimization, Mathematical Programming 6 (1974) 62\u201388.","journal-title":"Mathematical Programming"},{"key":"329784_CR29","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1137\/0801031","volume":"1","author":"P. Jog","year":"1991","unstructured":"P. Jog, J.Y. Suh and D. Van Gucht, Parallel genetic algorithms applied to the travelling salesman problem, SIAM Journal on Optimization 1 (1991) 515\u2013529.","journal-title":"SIAM Journal on Optimization"},{"key":"329784_CR30","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1109\/49.108679","volume":"9","author":"J. Hui","year":"1991","unstructured":"J. Hui, M. Gursoy, N. Moayeri and R. Yates, A layered broadband switching architecture with physical or virtual path configurations, IEEE Journal on Selected Areas in Communications 9 (1991) 1416\u20131425.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"329784_CR31","first-page":"891","volume":"18B","author":"S. Lanphongpanich","year":"1984","unstructured":"S. Lanphongpanich and D. Hearn, Simplical decomposition of the assymetric traffic assignment problem, Transportation Research 18 B (1984) 891\u2013904.","journal-title":"Transportation Research"},{"key":"329784_CR32","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler, Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)."},{"issue":"3","key":"329784_CR33","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/j.1538-7305.1989.tb00318.x","volume":"68","author":"D.N. Lee","year":"1989","unstructured":"D.N. Lee, K.T. Medhi, J. Strand, R. Cox and S. Chen, Solving large telecommunications network loading problems, AT&T Technical Journal 68(3) (1989) 48\u201356.","journal-title":"AT&T Technical Journal"},{"key":"329784_CR34","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/ijoc.4.3.250","volume":"4","author":"F.Y.S. Lin","year":"1992","unstructured":"F.Y.S. Lin and J.R. Yee, A new multiplier adjustment procedure for the distributed computation of routing assignments in virtual circuit data networks, ORSA Journal on Computing 4 (1992) 250\u2013266.","journal-title":"ORSA Journal on Computing"},{"issue":"10","key":"329784_CR35","first-page":"1071","volume":"E75-B","author":"M. Logothetis","year":"1992","unstructured":"M. Logothetis and S. Shioda, Centralized virtual path bandwidth allocation scheme for ATM network, IEICE Transactions on Communications E 75-B(10) (1992) 1071\u20131080.","journal-title":"IEICE Transactions on Communications"},{"key":"329784_CR36","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1287\/opre.30.5.907","volume":"30","author":"H. Luss","year":"1982","unstructured":"H. Luss, Operations research and capacity expansion problems: A survey, Operations Research 30 (1982) 907\u2013947.","journal-title":"Operations Research"},{"key":"329784_CR37","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1109\/TCOMM.1994.577080","volume":"42","author":"D. Medhi","year":"1994","unstructured":"D. Medhi, A unified approach to network survivability for teletraffic networks: Models, algorithms and analysis, IEEE Transactions on Communications 42 (1994) 534\u2013548.","journal-title":"IEEE Transactions on Communications"},{"key":"329784_CR38","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1109\/90.477726","volume":"3","author":"D. Medhi","year":"1995","unstructured":"D. Medhi, Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks, IEEE\/ACM Transactions on Networking 3 (1995) 809\u2013818.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"3","key":"329784_CR39","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0169-7552(96)00103-1","volume":"29","author":"D. Medhi","year":"1997","unstructured":"D. Medhi, Models for network design, servicing and monitoring of ATM networks based on the virtual path concept, Computer Networks & ISDN Systems 29(3) (1997) 373\u2013386.","journal-title":"Computer Networks & ISDN Systems"},{"issue":"2","key":"329784_CR40","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/BF02192181","volume":"88","author":"D. Medhi","year":"1996","unstructured":"D. Medhi and C.D. Ha, Generalized proximal point algorithm for convex optimization, Journal of Optimization Theory and Applications 88(2) (1996) 475\u2013488.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"329784_CR41","volume-title":"Mathematical Programming \u2013 Theory and Algorithms","author":"M. Minoux","year":"1986","unstructured":"M. Minoux, Mathematical Programming \u2013 Theory and Algorithms (Wiley, Chichester, 1986)."},{"key":"329784_CR42","doi-asserted-by":"crossref","unstructured":"H. M\u00fchlenbein, Parallel genetic algorithms in combinatorial optimization, in: Computer Science and Operations Research: New Developments in their Interfaces, eds. O. Balci, R. Sharda and S. Zenios (Pergamon, 1992) pp. 441\u2013453.","DOI":"10.1016\/B978-0-08-040806-4.50034-4"},{"key":"329784_CR43","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TCOM.1987.1096743","volume":"35","author":"T.M. Ng","year":"1987","unstructured":"T.M. Ng and D.B. Hoang, Joint optimization of capacity and flow assignment in a packet-switched communications network, IEEE Transactions on Communications 35 (1987) 202\u2013209.","journal-title":"IEEE Transactions on Communications"},{"key":"329784_CR44","doi-asserted-by":"crossref","unstructured":"K.E. Nygard and C.-H. Yang, Genetic algorithms for the traveling salesman problem with time windows, in: Computer Science and Operations Research: New Developments in their Interfaces, eds. O. Balci, R. Sharda and S. Zenios (Pergamon, 1992) pp. 411\u2013423.","DOI":"10.1016\/B978-0-08-040806-4.50032-0"},{"key":"329784_CR45","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/BF00929288","volume":"8","author":"W. Oettli","year":"1971","unstructured":"W. Oettli and W. Prager, Optimal and suboptimal capacity allocation in communication networks, Journal of Optimization Theory and Applications 8 (1971) 396\u2013411.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"329784_CR46","unstructured":"M. Pioro and B. Wallstrom, Multihour optimization of non-hierarchical circuit-switched communication networks with sequential routing, in: 11th Internat. Teletraffic Congress (1985)."},{"key":"329784_CR47","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"R.T. Rockafellar","year":"1976","unstructured":"R.T. Rockafellar, Augmented Lagrangian and applications of the proximal point algorithm in convex programming, Mathematics of Operations Research 1 (1976) 97\u2013116.","journal-title":"Mathematics of Operations Research"},{"key":"329784_CR48","doi-asserted-by":"crossref","unstructured":"E. Rolland and H. Pirkul, Heuristic solution procedures for the graph partioning problem, in: Computer Science and Operations Research: New Developments in their Interfaces, eds. O. Balci, R. Sharda and S. Zenios (Pergamon, 1992) pp. 475\u2013490.","DOI":"10.1016\/B978-0-08-040806-4.50036-8"},{"key":"329784_CR49","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1287\/opre.35.3.354","volume":"35","author":"E. Rosenberg","year":"1987","unstructured":"E. Rosenberg, A nonlinear programming heuristic for computing optimal link capacities in a multihour alternate routing communications network, Operations Research 35 (1987) 354\u2013367.","journal-title":"Operations Research"},{"key":"329784_CR50","doi-asserted-by":"crossref","unstructured":"R. Siebenhaar, Optimized ATM virtual path bandwidth management under fairness constraints, in: Proc. of IEEE GLOBECOM'94 (December 1994) pp. 924\u2013928.","DOI":"10.1109\/GLOCOM.1994.512794"},{"key":"329784_CR51","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/net.3230090105","volume":"9","author":"R.L. Smith","year":"1979","unstructured":"R.L. Smith, Deferral strategies for a dynamic communication network, Networks 9 (1979) 61\u201387.","journal-title":"Networks"},{"key":"329784_CR52","volume-title":"ISDN and Broadband ISDN with Frame Relay and ATM","author":"W. Stallings","year":"1995","unstructured":"W. Stallings, ISDN and Broadband ISDN with Frame Relay and ATM, 3rd ed. (Prentice-Hall, Englewood Cliffs, NJ, 1995).","edition":"3rd ed."},{"key":"329784_CR53","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/net.3230030302","volume":"3","author":"B. Yaged","year":"1973","unstructured":"B. Yaged, Minimum cost routing for dynamic network models, Networks 3 (1973) 193\u2013224.","journal-title":"Networks"},{"key":"329784_CR54","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230040104","volume":"4","author":"N. Zadeh","year":"1974","unstructured":"N. Zadeh, On building minimum cost communications network over time, Networks 4 (1974) 19\u201334.","journal-title":"Networks"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019148207669.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019148207669\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019148207669.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:23:55Z","timestamp":1754634235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019148207669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":54,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["329784"],"URL":"https:\/\/doi.org\/10.1023\/a:1019148207669","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}