Routing, flow, and capacity design in communication and computer networks

[1]  John E. Mitchell,et al.  Interior Point Methods for Large-Scale Linear Programming , 2006, Handbook of Optimization in Telecommunications.

[2]  Panos M. Pardalos,et al.  Design of survivable networks , 2006 .

[3]  Zoltán Fiala,et al.  Two new algorithms for UMTS access network topology design , 2005, Eur. J. Oper. Res..

[4]  Piotr Cholda,et al.  Network Recovery, Protection and Restoration of Optical, SONET-SDH, IP, and MPLS [Book Review] , 2005, IEEE Communications Magazine.

[5]  Ulrich Killat,et al.  Load balancing in IP networks by optimising link weights , 2005, Eur. Trans. Telecommun..

[6]  Artur Tomaszewski,et al.  A polynomial algorithm for solving a general max-min fairness problem , 2005, Eur. Trans. Telecommun..

[7]  João C. N. Clímaco,et al.  An algorithm for ranking quickest simple paths , 2005, Comput. Oper. Res..

[8]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[9]  Robert D. Doverspike,et al.  Comparison of capacity efficiency of DCS network restoration routing techniques , 1994, Journal of Network and Systems Management.

[10]  Deep Medhi,et al.  Impact of a transmission facility link failure on dynamic call routing circuit-switched networks under various circuit layout policies , 2005, Journal of Network and Systems Management.

[11]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[12]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[13]  D. Griffel.  Linear programming 2: Theory and extensions , by G. B. Dantzig and M. N. Thapa. Pp. 408. £50.00. 2003 ISBN 0 387 00834 9 (Springer). , 2004, The Mathematical Gazette.

[14]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[15]  Piet Demeester,et al.  Long-Term Planning of WDM Networks: A Comparison between Single-Period and Multi-Period Techniques , 2004, Photonic Network Communication.

[16]  Wayne D. Grover,et al.  Optimal Spare Capacity Preconfiguration for Faster Restoration of Mesh Networks , 2004, Journal of Network and Systems Management.

[17]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[18]  Roberto Sabella,et al.  An Innovative Solution for Dynamic Bandwidth Engineering in IP/MPLS Networks with QoS Support , 2004, Photonic Network Communications.

[19]  Jordi Castro,et al.  Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm , 2003, Ann. Oper. Res..

[20]  Michel Minoux,et al.  A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem , 2003, J. Heuristics.

[21]  S. De Maesschalck,et al.  Logical topology optimisation for dynamic multilayer recovery schemes , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[22]  R. Aubin,et al.  MPLS fast reroute and optical mesh protection: a comparative analysis of the capacity required for packet link protection , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[23]  S. Orlowski,et al.  Comparing restoration concepts using optimal network configurations with integrated hardware and routing decisions , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[24]  B. Sanso,et al.  A method for the integrated design of reliable GMPLS networks , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[25]  E. Kubilinskas,et al.  Design Models for Robust Multi-Layer Next Generation Internet Core Networks Carrying Elastic Traffic , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[26]  Deep Medhi,et al.  Backup path restoration design using path generation technique , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[27]  Eric Bouillet,et al.  Role of optical network and spare router strategy in resilient IP backbone architecture , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[28]  András Kern,et al.  Surviving multiple network failures using shared backup path protection , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[29]  Dave Katz,et al.  Traffic Engineering (TE) Extensions to OSPF Version 2 , 2003, RFC.

[30]  Gianpaolo Oriolo,et al.  A multilayer solution for path provisioning in new-generation optical/MPLS networks , 2003 .

[31]  Wlodzimierz Ogryczak,et al.  On solving linear programs with the ordered weighted averaging objective , 2003, Eur. J. Oper. Res..

[32]  Eduardo Camponogara,et al.  Implementing traffic engineering in MPLS-based IP networks with Lagrangean relaxation , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[33]  Michal Pióro,et al.  On efficient max-min fair routing algorithms , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[34]  Harish Sethu,et al.  On achieving fairness in the joint allocation of processing and bandwidth resources , 2003, IWQoS'03.

[35]  Eric V. Denardo,et al.  Dynamic Programming: Models and Applications , 2003 .

[36]  Biswanath Mukherjee,et al.  Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints , 2003, TNET.

[37]  Sid Kemp,et al.  CDMA Capacity and Quality Optimization , 2003 .

[38]  J. MacGregor Smith,et al.  A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem , 2003, J. Math. Model. Algorithms.

[39]  Paola Iovanna,et al.  A traffic engineering system for multilayer networks based on the GMPLS paradigm , 2003, IEEE Netw..

[40]  Avishai Wool,et al.  Combinatorial design of multi-ring networks with combined routing and flow control , 1999, Comput. Networks.

[41]  Michal Pioro,et al.  Link protection within existing backbone network , 2003 .

[42]  Didier Colle,et al.  On the optimization of the feedback loop for solving the multi-layer traffic grooming problem , 2003 .

[43]  Deep Medhi,et al.  Traffic engineering in the presence of tunneling and diversity constraints , 2003 .

[44]  George N. Rouskas,et al.  Optimal granularity of MPLS tunnels , 2003 .

[45]  Sungsoo Park,et al.  An Integer Programming Approach to the Path Selection Problems , 2003 .

[46]  Frank Kelly,et al.  Fairness and Stability of End-to-End Congestion Control , 2003, Eur. J. Control.

[47]  Laurence A. Wolsey,et al.  Strong formulations for mixed integer programs: valid inequalities and extended formulations , 2003, Math. Program..

[48]  I. Maros.  Computational Techniques of the Simplex Method , 2002 .

[49]  Michal Pióro,et al.  Solving dimensioning tasks for proportionally fair networks carrying elastic traffic , 2002, Perform. Evaluation.

[50]  Villy Bæk Iversen,et al.  Optimised Design and Analysis of All-Optical Networks , 2002 .

[51]  Panos M. Pardalos,et al.  A Genetic Algorithm for the Weight Setting Problem in OSPF Routing , 2002, J. Comb. Optim..

[52]  Yuanyuan Yang,et al.  Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable networks , 2002, Proceedings International Conference on Parallel Processing.

[53]  Dritan Nace,et al.  Design of survivable networks with a single facility , 2002, 2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563).

[54]  Michal Pióro,et al.  Link capacity dimensioning and path optimization for networks supporting elastic services , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[55]  Didier Colle,et al.  Data-centric optical networks and their survivability , 2002, IEEE J. Sel. Areas Commun..

[56]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[57]  Ali Ridha Mahjoub,et al.  Separation of partition inequalities for the (1, 2)-survivable network design problem , 2002, Oper. Res. Lett..

[58]  Dritan Nace,et al.  A linear programming based approach for computing optimal fair splittable routing , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[59]  Walid Ben-Ameur.  Multi-hour design of survivable classical IP networks , 2002, Int. J. Commun. Syst..

[60]  Armando N. Pinto,et al.  Optical Networks: A Practical Perspective, 2nd Edition , 2002 .

[61]  Michal Pióro,et al.  Optimal Link Capacity Dimensioning in Proportionally Fair Networks , 2002, NETWORKING.

[62]  Tibor Cinkler,et al.  Impact of shared protection strategies on network design , 2002 .

[63]  Michal Pioro,et al.  Robust dimensioning of proportionally fair networks , 2002 .

[64]  Didier Colle,et al.  Intelligent optical networking for multilayer survivability , 2002 .

[65]  Osman Ogtildeuz.  Generalized Column Generation for Linear Programming , 2002, Manag. Sci..

[66]  Zvi Drezner,et al.  Telecommunication and location , 2002 .

[67]  Michal Pióro,et al.  Topological design of MPLS networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[68]  Arjan Durresi,et al.  Survivability in IP over WDM networks , 2001, J. High Speed Networks.

[69]  Teodor Gabriel Crainic,et al.  Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..

[70]  Michel Minoux,et al.  Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods , 2001, Ann. Oper. Res..

[71]  Jaroslaw Arabas,et al.  Applying an evolutionary algorithm to telecommunication network design , 2001, IEEE Trans. Evol. Comput..

[72]  Hanan Luss,et al.  A Resource Allocation Approach for the Generation of Service-Dependent Demand Matrices for Communications Networks , 2001, Telecommun. Syst..

[73]  W. Wilhelm.  A Technical Review of Column Generation in Integer Programming , 2001 .

[74]  Deep Medhi,et al.  A network management framework for multi-layered network survivability: an overview , 2001, 2001 IEEE/IFIP International Symposium on Integrated Network Management Proceedings. Integrated Network Management VII. Integrated Management Strategies for the New Millennium (Cat. No.01EX470).

[75]  Zheng Wang,et al.  Internet traffic engineering without full mesh overlaying , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[76]  Leonidas Georgiadis,et al.  Lexicographically optimal balanced networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[77]  J.L. Strand,et al.  Ultra-long haul DWDM: tool support for economic studies , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

[78]  Jérôme Geffard.  A solving method for singly routing traffic demand in telecommunication networks , 2001, Ann. des Télécommunications.

[79]  K. G. Ramakrishnan,et al.  Optimal routing in shortest-path data networks , 2001, Bell Labs Technical Journal.

[80]  Iraj Saniee,et al.  ATM Network Design: Traffic Models and Optimization-Based Heuristics , 2001, Telecommun. Syst..

[81]  Harry G. Perros.  An Introduction to ATM Networks , 2001 .

[82]  Michal Pioro,et al.  Basic reconfiguration options in multi-layer robust telecommunication networks — design and performance issues , 2001 .

[83]  W. Ben-Ameur,et al.  Design of Survivible Networks Based on End-to-End Rerouting , 2001, DRCN.

[84]  Arnaud Knippel.  Modeles et algorithmes de multiflots a cout discontinu pour l'optimisation de reseaux de telecommunications , 2001 .

[85]  Michal Pioro,et al.  Path optimization for elastic traffic under fairness constraints , 2001 .

[86]  Tibor Cinkler,et al.  Approximative Algorithms for Con guration of Multi-Layer Networks with Protection , 2001 .

[87]  Leandros Tassiulas,et al.  A Simple Rate Control Algorithm for Maximizing Total User Utility. , 2001, INFOCOM 2001.

[88]  Artur Tomaszewski,et al.  A systematic approach to network planning , 2001 .

[89]  Leandros Tassiulas,et al.  Optimization based rate control for multipath sessions , 2001 .

[90]  Raz Danny,et al.  How good can IP routing be , 2001 .

[91]  M. Piórob,et al.  Topological design of telecommunication networks , 2001 .

[92]  R. Wessäly.  Dimensioning Survivable Capacitated Networks , 2000 .

[93]  Daniel Bienstock,et al.  Strong inequalities for capacitated survivable network design problems , 2000, Math. Program..

[94]  Ori Gerstel,et al.  Optical layer survivability-an implementation perspective , 2000, IEEE Journal on Selected Areas in Communications.

[95]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2000, SIGCOMM.

[96]  Walter Willinger,et al.  Self-Similar Network Traffic and Performance Evaluation , 2000 .

[97]  Deep Medhi,et al.  Some approaches to solving a multihour broadband network capacity design problem with single-path routing , 2000, Telecommun. Syst..

[98]  Dritan Nace,et al.  Assigning spare capacities in mesh survivable networks , 2000, Telecommun. Syst..

[99]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

[100]  장주욱.  [서평]「Wide Area Network Design : Concepts and Tools for Optimization」 , 2000 .

[101]  Di Yuan,et al.  A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..

[102]  Ali Ridha Mahjoub,et al.  Separation of Partition Inequalities , 2000, Math. Oper. Res..

[103]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[104]  Tibor Cinkler,et al.  Heuristic algorithms for joint configuration of the optical and electrical layer in multi-hop wavelength routing networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[105]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[106]  Rajiv Ramaswami,et al.  Optical layer survivability: a services perspective , 2000, IEEE Commun. Mag..

[107]  Jean Walrand,et al.  Fair end-to-end window-based congestion control , 1998, TNET.

[108]  Andrzej P. Wierzbicki,et al.  Model-based decision support , 2000 .

[109]  Wayne D. Grover.  Bridging the Ring-Mesh Dichotomy With P-Cycles , 2000 .

[110]  Tibor Cinkler,et al.  Stochastic Algorithms for Design of Thrifty Single-Failure-Protected Networks , 2000 .

[111]  L. Jereb,et al.  Availability analysis of multi-layer optical networks , 2000 .

[112]  Yuval Rabani,et al.  Fairness in routing and load balancing , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[113]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[114]  Christian Huitema,et al.  Routing in the Internet (2nd ed.) , 1999 .

[115]  Michel Minoux,et al.  Exact solution of multicommodity network optimization problems with general step cost functions , 1999, Oper. Res. Lett..

[116]  Piet Demeester,et al.  Resilience in multilayer networks , 1999, IEEE Commun. Mag..

[117]  Andrés Marzal,et al.  Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison , 1999, WAE.

[118]  Michael M. Kostreva,et al.  Linear optimization with multiple equitable criteria , 1999, RAIRO Oper. Res..

[119]  Clifford Stein,et al.  Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow , 1999, IPCO.

[120]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[121]  Or Chronicle.  ON EQUITABLE RESOURCE ALLOCATION PROBLEMS: A LEXICOGRAPHIC MINIMAX APPROACH , 1999 .

[122]  T. Cinkler,et al.  Protection through Thrifty Connguration , 1999 .

[123]  J. Gondzio,et al.  Regularized Symmetric Indefinite Systems in Interior Point Methods for Linear and Quadratic Optimization , 1999 .

[124]  Michel X. Goemans,et al.  On the Single-Source Unsplittable Flow Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[125]  오병균,et al.  [서평]「Computer Algorithms/C++」 , 1998 .

[126]  Yiwei Thomas Hou,et al.  A generic weight-based network bandwidth sharing policy for ATM ABR service , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[127]  Phillip J. Lederer,et al.  Airline Network Design , 1998, Oper. Res..

[128]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

[129]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

[130]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[131]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[132]  Johan Hellstrand,et al.  Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound , 1998, Oper. Res..

[133]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.

[134]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[135]  Tam As Terlaky.  An Easy Way to Teach Interior Point Methods , 1998 .

[136]  Geir Dahl,et al.  A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems , 1998, INFORMS J. Comput..

[137]  Piet Demeester,et al.  A multi-layer planning approach for hybrid SDH-based ATN networks , 1998 .

[138]  C. Simkin..  About Economic Inequality , 1998 .

[139]  M. Ehrgott.  Discrete Decision Problems, Multiple Criteria Optimization Classes and Lexicographic Max-Ordering , 1998 .

[140]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[141]  On Optimal Location of Switches / Routers and Interconnection , 1998 .

[142]  Martin Grötschel,et al.  Cost-efficient network synthesis from leased lines , 1998, Ann. Oper. Res..

[143]  kc claffy,et al.  The nature of the beast: Recent traffic measurements from an Internet backbone , 1998 .

[144]  Brunilde Sansò,et al.  Tabu Search and Post-Optimization Algorithms for the Topological Update of Two-Level Networks with Modular Switches , 1997 .

[145]  Moti Yung,et al.  Combinatorial design of congestion-free networks , 1997, TNET.

[146]  Wlodzimierz Ogryczak,et al.  On the lexicographic minimax approach to location problems , 1997, Eur. J. Oper. Res..

[147]  Michal Pióro,et al.  Solving multicommodity integral flow problems by simulated allocation , 1997, Telecommun. Syst..

[148]  Yiwei Thomas Hou,et al.  A simple ABR switch algorithm for the weighted max-min fairness policy , 1997, IEEE ATM '97 Workshop Proceedings (Cat. No.97TH8316).

[149]  Krzysztof C. Kiwiel,et al.  Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization , 1997, SIAM J. Optim..

[150]  Zbigniew Dziong,et al.  ATM Network Resource Management , 1997 .

[151]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[152]  Song Chong,et al.  Rate control algorithms for the ATM ABR service , 1997, Eur. Trans. Telecommun..

[153]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[154]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[155]  Herbert S. Wilf,et al.  Algorithms and Complexity , 1994, Lecture Notes in Computer Science.

[156]  조국현,et al.  [서평]Internetworking with TCP/IP , 1996 .

[157]  Jon M. Kleinberg,et al.  Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[158]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[159]  Sungsoo Park,et al.  An Integer Programming Approach to the Bandwidth Packing Problem , 1996 .

[160]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[161]  Ken-ichi Sato.  Advances in Transport Network Technologies: Photonic Networks, ATM, and SDH , 1996 .

[162]  Michel Gendreau,et al.  Optimizing routing in packet-switched networks with non-Poisson offered traffic , 1996, Telecommun. Syst..

[163]  Jacek Gondzio,et al.  Multiple centrality corrections in a primal-dual method for linear programming , 1996, Comput. Optim. Appl..

[164]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[165]  K. G. Ramakrishnan,et al.  ATM network design and optimization: a multirate loss network framework , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[166]  P. A. Veitch,et al.  Enhancing the self-healing capability of statically protected ATM networks , 1996, Modelling and Evaluation of ATM Networks.

[167]  Moti Yung,et al.  Approximating max-min fair rates via distributed local scheduling with partial information , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[168]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[169]  J. L. Lutton,et al.  A simulated annealing algorithm for the computation of marginal costs of telecommunication links , 1996 .

[170]  Bruce S. Davie,et al.  Computer Networks: A Systems Approach , 1996 .

[171]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[172]  Jacek Gondzio,et al.  Implementation of Interior Point Methods for Large Scale Linear Programming , 1996 .

[173]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[174]  M. Herzberg,et al.  The hop-limit approach for spare-capacity assignment in survivable networks , 1995, TNET.

[175]  B. Sengupta,et al.  A link based alternative routing scheme for network restoration under failure , 1995, Proceedings of GLOBECOM '95.

[176]  G. Anandalingam,et al.  A bootstrap heuristic for designing minimum cost survivable networks , 1995, Comput. Oper. Res..

[177]  Tamás Henk,et al.  A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Configuration , 1995, IEEE J. Sel. Areas Commun..

[178]  J. Gondzio.  HOPDM (version 2.12) — A fast LP solver based on a primal-dual interior point method , 1995 .

[179]  Raj Jain,et al.  Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[180]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[181]  M. Padberg.  Linear Optimization and Extensions , 1995 .

[182]  Deep Medhi,et al.  Optimization and Performance of Network Restoration Schemes for Wide-Area Teletraffic Networks , 1995, J. Netw. Syst. Manag..

[183]  Gilles Brassard,et al.  Fundamentals of Algorithmics , 1995 .

[184]  F. Glover.  Tabu Search Fundamentals and Uses , 1995 .

[185]  David Eppstein,et al.  Finding the k shortest paths , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[186]  Amitava Dutta,et al.  Capacity planning of private networks using DCS under multibusy-hour traffic , 1994, IEEE Trans. Commun..

[187]  T. Magnanti,et al.  Modeling and heuristic worst-case performance analysis of the two-level network design problem , 1994 .

[188]  Eric Rosenberg.  Designing multi-hour hierarchical communications networks with fixed charge and piecewise linear costs , 1994, Telecommun. Syst..

[189]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[190]  M. M. Slominski,et al.  Guided restoration of ATM cross-connect networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[191]  T. Magnanti,et al.  A Dual-Based Algorithm for Multi-Level Network Design , 1994 .

[192]  Michael T. Marsh,et al.  Equity measurement in facility location analysis: A review and framework , 1994 .

[193]  Kemal Altinkemer,et al.  Topological design of ring networks , 1994, Comput. Oper. Res..

[194]  Deep Medhi,et al.  A unified approach to network survivability for teletraffic networks: models, algorithms and analysis , 1994, IEEE Trans. Commun..

[195]  H. Peyton Young,et al.  Equity - in theory and practice , 1994 .

[196]  Ulrich Gremmelmaier.  Topological Design of Metropolitan Area Networks , 1994 .

[197]  Robert D. Doverspike,et al.  Network design sensitivity studies for use of digital cross-connect systems in survivable network architectures , 1994, IEEE J. Sel. Areas Commun..

[198]  R. H. Cardwell,et al.  Survivable SONET networks-design methodology , 1994, IEEE J. Sel. Areas Commun..

[199]  Bezalel Gavish,et al.  Telecommunications network topological design and capacity expansion: Formulations and algorithms , 1993, Telecommun. Syst..

[200]  Jennifer Ryan,et al.  A column generation algorithm for bandwidth packing , 1993, Telecommun. Syst..

[201]  Sylvia C. Boyd,et al.  An Integer Polytope Related to the Design of Survivable Communication Networks , 1993, SIAM J. Discret. Math..

[202]  Warren B. Powell,et al.  Multicommodity network flows: The impact of formulation on decomposition , 1993, Math. Program..

[203]  Hiroyuki Okazaki,et al.  Multi-ring approach for ATM-VP networks survivability , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[204]  R. Sridharan.  A Lagrangian heuristic for the capacitated plant location problem with single source constraints , 1993 .

[205]  Choong Y. Lee.  An Algorithm for the Design of Multitype Concentrator Networks , 1993 .

[206]  Jennifer Ryan,et al.  Path assignment for call routing: An application of tabu search , 1993, Ann. Oper. Res..

[207]  F. Glover,et al.  Bandwidth packing: a tabu search approach , 1993 .

[208]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[209]  Hector A. Rosales-Macedo.  Nonlinear Programming: Theory and Algorithms (2nd Edition) , 1993 .

[210]  Aaron Kershenbaum,et al.  Telecommunications Network Design Algorithms , 1993 .

[211]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[212]  Tsong-Ho Wu,et al.  Fiber Network Service Survivability , 1992 .

[213]  Amitava Dutta,et al.  A Multiperiod Capacity Planning Model for Backbone Computer Communication Networks , 1992, Oper. Res..

[214]  Frank Y. S. Lin,et al.  A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks , 1992, INFORMS J. Comput..

[215]  Hanan Luss,et al.  A lexicographic minimax algorithm for multiperiod resource allocation , 1992, Math. Program..

[216]  Kemal Altinkemer,et al.  Topological design of wide area communication networks , 1992, Ann. Oper. Res..

[217]  H. Levy.  Stochastic dominance and expected utility: survey and analysis , 1992 .

[218]  J. Oviedo,et al.  Lexicographic optimality in the multiple objective linear programming: The nucleolar solution , 1992 .

[219]  Hasan Pirkul,et al.  Hierarchical concentrator location problem , 1992, Comput. Commun..

[220]  Martin Grötschel,et al.  Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..

[221]  Frank Yeong-Sung Lin,et al.  A routing algorithm for virtual circuit data networks with multiple sessions per O - D pair , 1992, Networks.

[222]  Stef Tijs,et al.  The Nucleolus of a Matrix Game and Other Nucleoli , 1992, Math. Oper. Res..

[223]  Heinz Mühlenbein,et al.  How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.

[224]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[225]  R. Doverspike.  A multi-layered model for survivability in intra-LATA transport networks , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[226]  R. D. Doverspike.  Algorithms for Multiplex Bundling in a Telecommunications Network , 1991, Oper. Res..

[227]  Liang T. Wu,et al.  Using distributed topology update and preplanned configurations to achieve trunk network survivability , 1991 .

[228]  O. J. Wasem,et al.  An algorithm for designing rings for survivable fiber networks , 1991 .

[229]  Franz Rendl,et al.  Lexicographic bottleneck problems , 1991, Oper. Res. Lett..

[230]  Christos Douligeris,et al.  Fairness in network optimal flow control: optimality of product forms , 1991, IEEE Trans. Commun..

[231]  Emile H. L. Aarts,et al.  Global optimization and simulated annealing , 1991, Math. Program..

[232]  J. Bell.  Decision Making: Descriptive , 1991 .

[233]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[234]  Hideki Sakauchi,et al.  A self-healing network with an economical spare-channel assignment , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[235]  Ross W. Callon,et al.  Use of OSI IS-IS for routing in TCP/IP and dual environments , 1990, RFC.

[236]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[237]  Ken-ichi Sato,et al.  Broad-band ATM network architecture based on virtual paths , 1990, IEEE Trans. Commun..

[238]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[239]  Roshan Lal Sharma.  Network Topology Optimization , 1990 .

[240]  G. Bannock,et al.  The Penguin Dictionary of Economics , 1990 .

[241]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[242]  Wai-Kai Chen.  Theory of nets - flows in networks , 1990 .

[243]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[244]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[245]  Moshe Dror,et al.  Fiberoptic circuit network design under reliability constraints , 1989, IEEE J. Sel. Areas Commun..

[246]  Marshall W. Bern,et al.  The Steiner Problem with Edge Lengths 1 and 2 , 1989, Inf. Process. Lett..

[247]  C. Monma,et al.  Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints , 1989, Oper. Res..

[248]  Laurence Wolsey,et al.  Strong formulations for mixed integer programming: A survey , 1989, Math. Program..

[249]  James A. McHugh,et al.  Algorithmic Graph Theory , 1986 .

[250]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM '89.

[251]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..

[252]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[253]  A. Volgenant,et al.  Reducing the hierarchical network design problem , 1989 .

[254]  J. W. Popper.  Restoration of fiber networks: a comparison of ring versus route diversity , 1989, Proceedings. IEEE Energy and Information Technologies in the Southeast'.

[255]  T. B. Boffey.  Location Problems Arising in Computer Networks , 1989 .

[256]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[257]  Martin Grötschel,et al.  Polyhedral Approaches to Network Survivability , 1989, Reliability Of Computer And Communication Networks.

[258]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[259]  K. Devlin.  Mathematics : The New Golden Age , 1988 .

[260]  A. Volgenant,et al.  Operations management: Strategy and analysis , 1988 .

[261]  C. H. Yang,et al.  FITNESS-failure immunization technology for network services survivability , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[262]  Don M. Tow.  Network management-recent advances and future trends , 1988, IEEE J. Sel. Areas Commun..

[263]  Chawn-Yaw Jeng.  AN IDEALIZED MODEL FOR UNDERSTANDING IMPACTS OF KEY NETWORK PARAMETERS ON AIRLINE ROUTING , 1988 .

[264]  J. Mongan.  University of Missouri-Kansas City. , 1988, Missouri medicine.

[265]  V. Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[266]  Hasan Pirkul,et al.  Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..

[267]  Eric Rosenberg,et al.  A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network , 1987, Oper. Res..

[268]  Michael Florian,et al.  An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem , 1987, Networks.

[269]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[270]  J. Current,et al.  The hierarchical network design problem , 1986 .

[271]  Hanan Luss,et al.  A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints , 1986 .

[272]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[273]  F. Behringer.  Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions , 1986 .

[274]  David K. Smith,et al.  Mathematical Programming: Theory and Algorithms , 1986 .

[275]  A. Kanafani,et al.  AIRLINE HUBBING : SOME IMPLICATIONS FOR AIRPORT ECONOMICS , 1985 .

[276]  椹木 義一,et al.  Theory of multiobjective optimization , 1985 .

[277]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[278]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[279]  Hanan Luss.  A capacity expansion model with applications to multiplexing in communication networks , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[280]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[281]  Roy D. Shapiro,et al.  Optimization models for planning and allocation: Text and cases in mathematical programming , 1984 .

[282]  Kenneth H. Rosen.  Discrete mathematics and its applications , 1984 .

[283]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[284]  Hanan Luss,et al.  Operations Research and Capacity Expansion Problems: A Survey , 1982, Oper. Res..

[285]  G. Ash,et al.  Servicing and real-time control of networks with dynamic routing , 1981, The Bell System Technical Journal.

[286]  R. H. Cardwell,et al.  Design and optimization of networks with dynamic routing , 1981, The Bell System Technical Journal.

[287]  F. Behringer.  A simplex based algorithm for the lexicographically extended linear maxmin problem , 1981 .

[288]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[289]  M. Minoux,et al.  Synthèse optimale d’un réseau de télécommunication avec contraintes de sécurité , 1981 .

[290]  M. Minoux.  Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .

[291]  Bruce A. Murtagh,et al.  Advanced linear programming: Computation and practice , 1981 .

[292]  Lee J. Krajewski,et al.  Management science : quantitative methods in context , 1981 .

[293]  M. Minoux,et al.  Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints , 1981 .

[294]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[295]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[296]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[297]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.

[298]  J.K. Wolf,et al.  Computer-communication network design and analysis , 1979, Proceedings of the IEEE.

[299]  A. Land,et al.  Computer Codes for Problems of Integer Programming , 1979 .

[300]  Jacobus P. H. Wessels,et al.  The art and theory of dynamic programming , 1977 .

[301]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[302]  Godwin C. Ovuworie,et al.  Mathematical Programming: Structures and Algorithms , 1979 .

[303]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[304]  Arjang A. Assad,et al.  Multicommodity network flows - A survey , 1978, Networks.

[305]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[306]  W. Elsner.  A descent algorithm for the multihour sizing of traffic networks , 1977, The Bell System Technical Journal.

[307]  E.M.L. Beale,et al.  Branch and Bound Methods for Mathematical Programming Systems , 1977 .

[308]  R. Boorstyn,et al.  Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..

[309]  M. Eisenberg.  Engineering traffic networks for more than one busy hour , 1977, The Bell System Technical Journal.

[310]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[311]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[312]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[313]  H. Dirilten,et al.  Topological Design of Teleprocessing Networks Using Linear Regression Clustering , 1976, IEEE Trans. Commun..

[314]  小田 正雄.  アメリカの大学院生活--Southern Methodist University , 1976 .

[315]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[316]  Nimrod Megiddo,et al.  Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..

[317]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[318]  T. C. Hu.  Optimum Communication Spanning Trees , 1974, SIAM J. Comput..

[319]  Norman Zadeh,et al.  On building minimum cost communication networks over time , 1974, Networks.

[320]  R. Weischedel,et al.  Optimal Network Problem: A Branch-and-Bound Algorithm , 1973 .

[321]  Robert G. Jeroslow,et al.  The simplex algorithm with the pivot rule of maximizing criterion improvement , 1973, Discret. Math..

[322]  Hoang Hai Hoc.  A Computational Approach to the Selection of an Optimal Network , 1973 .

[323]  Bernard Yaged.  Minimum cost routing for dynamic network models , 1973, Networks.

[324]  Norman Zadeh,et al.  On building minimum cost communication networks , 1973, Networks.

[325]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[326]  G. Nemhauser,et al.  Integer Programming , 2020 .

[327]  S. M. Robinson,et al.  A quadratically-convergent algorithm for general nonlinear programming problems , 1972, Math. Program..

[328]  Wushow Chou,et al.  Topological optimization of computer networks , 1972 .

[329]  David Mautner Himmelblau,et al.  Applied Nonlinear Programming , 1972 .

[330]  R. F. Brown,et al.  PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).

[331]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[332]  J. Rawls,et al.  A Theory of Justice , 1971, Princeton Readings in Political Thought.

[333]  W. Prager,et al.  Optimal and suboptimal capacity allocation in communication networks , 1971 .

[334]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[335]  Bernard Yaged,et al.  Minimum cost routing for static network models , 1971, Networks.

[336]  J. D. Murchland,et al.  Braess's paradox of traffic flow , 1970 .

[337]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[338]  E. M. L. Beale,et al.  Nonlinear Programming: A Unified Approach. , 1970 .

[339]  James H. Greene,et al.  Production and Inventory Control Handbook , 1970 .

[340]  A. Scott.  The optimal network problem: Some computational procedures , 1969 .

[341]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[342]  N. S. Barnett,et al.  Private communication , 1969 .

[343]  William Orchard-Hays,et al.  Advanced Linear-Programming Computing Techniques , 1968 .

[344]  J. Reed,et al.  Simulation of biological evolution and machine learning. I. Selection of self-reproducing numeric patterns by data processing machines, effects of hereditary control, mutation type and crossing. , 1967, Journal of theoretical biology.

[345]  Allen A. Goldstein,et al.  Constructive Real Analysis , 1967 .

[346]  J. A. Tomlin,et al.  Minimum-Cost Multicommodity Network Flows , 1966, Oper. Res..

[347]  Wilfred Candler,et al.  Nonlinear and Dynamic Programming , 1965 .

[348]  P. B. Coaker,et al.  Applied Dynamic Programming , 1964 .

[349]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[350]  J. B. Rosen.  The gradient projection method for nonlinear programming: Part II , 1961 .

[351]  B. Gluss.  AN INTRODUCTION TO DYNAMIC PROGRAMMING , 1961 .

[352]  R. Acton.  Introduction to Congestion Theory in Telephone Systems , 1961 .

[353]  G. Dantzig,et al.  The decomposition algorithm for linear programming: notes on linear programming and extensions-part 57. , 1961 .

[354]  R. Gomory.  AN ALGORITHM FOR THE MIXED INTEGER PROBLEM , 1960 .

[355]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[356]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[357]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[358]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[359]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[360]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[361]  F. Knight.  Some Fallacies in the Interpretation of Social Cost , 1924 .

[362]  A. M. Carr-Saunders,et al.  Wealth and Welfare , 1913 .

[363]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[364]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[365]  Chai Luy.  Paper Special Issue On`telecommunications Network Planning and Design' Dimensioning and Computational Results for Wide-area Broadband Networks with Two-level Dynamic Routing , 2022 .