{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:36:03Z","timestamp":1767339363824,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121005"},{"type":"electronic","value":"9783642121012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12101-2_47","type":"book-chapter","created":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T12:16:59Z","timestamp":1270124219000},"page":"460-470","source":"Crossref","is-referenced-by-count":3,"title":["Solving QoS Routing Problems by DCA"],"prefix":"10.1007","author":[{"given":"Ta Anh","family":"Son","sequence":"first","affiliation":[]},{"given":"Le Thi Hoai","family":"An","sequence":"additional","affiliation":[]},{"given":"Djamel","family":"Khadraoui","sequence":"additional","affiliation":[]},{"given":"Pham Dinh","family":"Tao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"47_CR1","first-page":"169","volume":"27","author":"L.T. Hoai An","year":"1999","unstructured":"Hoai An, L.T., Pham Dinh, T., Muu, L.D.: Exact penalty in d.c. programming. Vietnam Journal of Mathematics\u00a027(2), 169\u2013178 (1999)","journal-title":"Vietnam Journal of Mathematics"},{"issue":"1-2","key":"47_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1080\/02331930108844555","volume":"50","author":"L.T. Hoai An","year":"2001","unstructured":"Hoai An, L.T., Pham Dinh, T.: A Continuous approach for globally solving linearly constrained quadratic zero-one programming problem. Optimization\u00a050(1-2), 93\u2013120 (2001)","journal-title":"Optimization"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"L.T. Hoai An","year":"2005","unstructured":"Hoai An, L.T., Pham Dinh, T.: The DC (difference of convex functions) Programming and DCA revisited with DC models of real world non convex optimization problems. Annals of Operations Research\u00a0133, 23\u201346 (2005)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"47_CR4","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1109\/TNET.2005.852882","volume":"13","author":"F.A. Kuipers","year":"2005","unstructured":"Kuipers, F.A., Van Mieghem, P.F.A.: Conditions That Impact the Complexity of QoS Routing. IEEE\/ACM Transactions on Volume Networking\u00a013(4), 717\u2013730 (2005)","journal-title":"IEEE\/ACM Transactions on Volume Networking"},{"issue":"12","key":"47_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MCOM.2002.1106159","volume":"40","author":"F.A. Kuipers","year":"2002","unstructured":"Kuipers, F.A., Korkmaz, T., Krunz, M., Van Mieghem, P.: Overview of constraint-based path selection algorithms for QoS routing. IEEE Commun. Mag.\u00a040(12), 50\u201355 (2002)","journal-title":"IEEE Commun. Mag."},{"key":"47_CR6","unstructured":"Chen, S., Nahrstedt, C.: On Finding Multi-constrained Paths. International Journal of Computational Geometry and Applications (1998)"},{"issue":"1","key":"47_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation Schemes for the Restricted Shortest Path Problem. Mathematics of Operations Research\u00a017(1), 36\u201342 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"47_CR8","unstructured":"Liu, G., Ramakrushnam, K.G.: A*Prune: an algorithm for finding K shortest paths subject to multiple constraints. In: IEEE INFOCOM 2001, April 2, 2001, pp. 743\u2013749 (2001)"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"Lorenz, D.H., Orda, A., Raz, D., Shavitt, Y.: Efficient QoS Partition and Routing of Unicast and Multicast. In: Proceedings IEEE\/IFIP IWQoS, Pittsburgh, PA (June 2000)","DOI":"10.1109\/IWQOS.2000.847940"},{"issue":"4","key":"47_CR10","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0140-3664(02)00156-1","volume":"26","author":"P.V. Mieghem","year":"2003","unstructured":"Mieghem, P.V., Kuipers, F.A.: On the complexity of QoS routing. Computer Communications\u00a026(4), 376\u2013387 (2003)","journal-title":"Computer Communications"},{"issue":"5","key":"47_CR11","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1109\/TNET.2004.836112","volume":"12","author":"P.V. Mieghem","year":"2004","unstructured":"Mieghem, P.V., Kuipers, F.A.: Concepts of exact QoS routing algorithms. IEEE\/ACM Trans. on Networking\u00a012(5), 851\u2013864 (2004)","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Orda, A., Sprintson, A.: Efficient algorithm for computing disjoint QoS paths. In: IEEE INFOCOM 2004, March 1, 2004, pp. 727\u2013738 (2004)","DOI":"10.1109\/INFCOM.2004.1354543"},{"issue":"1","key":"47_CR13","first-page":"289","volume":"22","author":"T. Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Hoai An, L.T.: Convex analysis approach to DC programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica, dedicated to Professor Hoang Tuy on the occassion of his 70th birthday\u00a022(1), 289\u2013357 (1997)","journal-title":"Acta Mathematica Vietnamica, dedicated to Professor Hoang Tuy on the occassion of his 70th birthday"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T. Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Hoai An, L.T.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optimization\u00a08, 476\u2013505 (1998)","journal-title":"SIAM J. Optimization"},{"key":"47_CR15","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"Q. Warburton","year":"1987","unstructured":"Warburton, Q.: Approximation of Pareto Optima in Multiple Objective Shortest Path Problems. Operations Research\u00a035, 70\u201379 (1987)","journal-title":"Operations Research"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"Yuan, X., Liu, X.: Heuristic algorithms for multi-constrained quality of service routing. In: Proceedings of INFOCOM 2001, vol.\u00a02, pp. 844\u2013853 (2001)","DOI":"10.1109\/INFCOM.2001.916275"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12101-2_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T20:27:00Z","timestamp":1739996820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12101-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121005","9783642121012"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12101-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}