{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T15:45:35Z","timestamp":1773243935095,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1109\/icnc.2014.6975985","type":"proceedings-article","created":{"date-parts":[[2014,12,10]],"date-time":"2014-12-10T16:45:28Z","timestamp":1418229928000},"page":"1050-1055","source":"Crossref","is-referenced-by-count":2,"title":["The k-splittable flow model and a heuristic algorithm for minimizing congestion in the MPLS networks"],"prefix":"10.1109","author":[{"given":"Chengwen","family":"Jiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinben","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.10.001"},{"key":"ref11","article-title":"A decomposition based on path sets for the Multi-commodity k-splittable Maximum Flow Problem","author":"gamst","year":"2013","journal-title":"DTU Management Engineering"},{"key":"ref12","year":"0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.12.009"},{"key":"ref3","first-page":"244","article-title":"Approximation and complexity of k-splittable flows","author":"koch","year":"2005","journal-title":"Approximation and Online Algorithms Third International Workshop WAOA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-009-0147-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.12.004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.01.002"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-007-0055-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9068-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1167-9"},{"key":"ref9","article-title":"Using branch-and-price to solve multicommodity k-splittable flow problem","author":"truffot","year":"2005","journal-title":"Proceedings of International Network Optimization Conference(INOC) In INOC Conference"}],"event":{"name":"2014 10th International Conference on Natural Computation (ICNC)","location":"Xiamen","start":{"date-parts":[[2014,8,19]]},"end":{"date-parts":[[2014,8,21]]}},"container-title":["2014 10th International Conference on Natural Computation (ICNC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6963214\/6975799\/06975985.pdf?arnumber=6975985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T20:42:53Z","timestamp":1502397773000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6975985\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icnc.2014.6975985","relation":{},"subject":[],"published":{"date-parts":[[2014,8]]}}}