{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:54:39Z","timestamp":1767138879363,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_21","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"242-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Fortz","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Gouveia","sequence":"additional","affiliation":[]},{"given":"Martim","family":"Moniz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"21_CR1","unstructured":"IEEE Computer Society: Ieee standard for information technology- telecommunications and information exchange between systems- local and metropolitan area networks- common specifications part 3: Media access control (mac) bridges. ANSI\/IEEE Std 802.1D, 1998 Edition, i-355 (1998)"},{"key":"21_CR2","unstructured":"IEEE Computer Society: Ieee standard for local and metropolitan area networks virtual bridged local area networks. IEEE Std 802.1Q-2005 (Incorporates IEEE Std 802.1Q1998, IEEE Std 802.1u-2001, IEEE Std 802.1v-2001, and IEEE Std 802.1s-2002), 0_1\u2013285 (2006)"},{"key":"21_CR3","unstructured":"IEEE Computer Society: Ieee standards for local and metropolitan area networks\u2013 virtual bridged local area networks\u2013 amendment 3: Multiple spanning trees. IEEE Std 802.1s-2002 (Amendment to IEEE Std 802.1Q, 1998 Edition), 0_1-211 (2002)"},{"key":"21_CR4","unstructured":"Ho, T.: Traffic engineering techniques for data center networks. Ph.D. thesis, Ecole polytechnique de Louvain, Universit\u00e9 catholique de Louvain (2012)"},{"key":"21_CR5","unstructured":"He, X., Zhu, M., Chu, Q.: Traffic engineering for metro ethernet based on multiple spanning trees. In: International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL\u201906), pp. 97\u201397. IEEE (2006)"},{"key":"21_CR6","unstructured":"Lim, Y., Yu, H., Das, S., Lee, S.S., Gerla, M.: QoS-aware multiple spanning tree mechanism over a bridged LAN environment. In: IEEE Global Telecommunications Conference (IEEE Cat. No. 03CH37489), GLOBECOM \u201903, vol. 6, pp. 3068\u20133072. IEEE (2003)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Meddeb, A.: Multiple spanning tree generation and mapping algorithms for carrier class ethernets. In: IEEE Globecom 2006, pp. 1\u20135. IEEE (2006)","DOI":"10.1109\/GLOCOM.2006.245"},{"key":"21_CR8","unstructured":"de Sousa, A., Soares, G.: Improving load balance and minimizing service disruption on ethernet networks with IEEE 802.1S MSTP. In: Workshop on IP QoS and Traffic Control, pp. 25\u201335 (2007)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Santos, D., de Sousa, A., Alvelos, F., Dzida, M., Pi\u00f3ro, M., Zagozdzon, M.: Traffic engineering of multiple spanning tree routing networks: the load balancing case. In: Next Generation Internet Networks, NGI \u201909, pp. 1\u20138 (2009)","DOI":"10.1109\/NGI.2009.5175784"},{"issue":"1\u20132","key":"21_CR10","first-page":"109","volume":"48","author":"D Santos","year":"2010","unstructured":"Santos, D., de Sousa, A., Alvelos, F., Dzida, M., Pi\u00f3ro, M.: Optimization of link load balancing in multiple spanning tree routing networks. Telecommun. Syst. 48(1\u20132), 109\u2013124 (2010)","journal-title":"Telecommun. Syst."},{"key":"21_CR11","first-page":"503","volume-title":"Handbooks in Operations Research and Management Science","author":"TL Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M.O., et al. (eds.) Handbooks in Operations Research and Management Science, vol. 7, pp. 503\u2013615. Elsevier Science, Amsterdam (1995)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Chen, W., Jin, D., Zeng, L.: Design of multiple spanning trees for traffic engineering in metro ethernet. In: 2006 International Conference on Communication Technology, pp. 1\u20134. IEEE (2006)","DOI":"10.1109\/ICCT.2006.341953"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Padmaraj, M., Nair, S., Marchetti, M., Chiruvolu, G., Ali, M., Ge, A.: Metro ethernet traffic engineering based on optimal multiple spanning trees\u00a0. In: Second IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2005, pp. 568\u2013572. IEEE (2005)","DOI":"10.1109\/WOCN.2005.1436090"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Mirjalily, G., Sigari, F.A., Saadat, R.: Best multiple spanning tree in metro ethernet networks. In: 2009 Second International Conference on Computer and Electrical Engineering, pp. 117\u2013121. IEEE (2009)","DOI":"10.1109\/ICCEE.2009.200"},{"issue":"5","key":"21_CR15","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., Magnanti, T.L., Wong, R.T.: A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. 37(5), 716\u2013740 (1989)","journal-title":"Oper. Res."},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"RK Martin","year":"1991","unstructured":"Martin, R.K.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10(3), 119\u2013128 (1991)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-010-0122-z","volume":"8","author":"M Conforti","year":"2010","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Extended formulations in combinatorial optimization. 4OR 8(1), 1\u201348 (2010)","journal-title":"4OR"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.endm.2013.05.079","volume":"41","author":"E Fern\u00e1ndez","year":"2013","unstructured":"Fern\u00e1ndez, E., Luna-Mota, C., Hildenbrandt, A., Reinelt, G., Wiesberg, S.: A flow formulation for the optimum communication spanning tree. Electron. Notes Discrete Math. 41, 85\u201392 (2013)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/B:COAP.0000039487.35027.02","volume":"29","author":"B Fortz","year":"2004","unstructured":"Fortz, B., Thorup, M.: Increasing internet capacity using local search. Comput. Optim. Appl. 29(1), 13\u201348 (2004)","journal-title":"Comput. Optim. Appl."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:51:44Z","timestamp":1746294704000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":19,"aliases":["10.1007\/978-3-319-14115-2_21"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}