{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:40:29Z","timestamp":1726062029900},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030364113"},{"type":"electronic","value":"9783030364120"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36412-0_33","type":"book-chapter","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:04:15Z","timestamp":1575590655000},"page":"412-424","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Some Graph Optimization Problems with Weights Satisfying Linear Constraints"],"prefix":"10.1007","author":[{"given":"Kameng","family":"Nip","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenbo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianning","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Richard M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103 (1972)"},{"key":"33_CR2","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Courier Dover Publications, New York (1998)"},{"key":"33_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2012","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2016.02.028","volume":"253","author":"K Nip","year":"2016","unstructured":"Nip, K., Wang, Z., Wang, Z.: Scheduling under linear constraints. Eur. J. Oper. Res. 253(2), 290\u2013297 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10898-017-0540-y","volume":"69","author":"K Nip","year":"2017","unstructured":"Nip, K., Wang, Z., Wang, Z.: Knapsack with variable weights satisfying linear constraints. J. Global Optim. 69(3), 713\u2013725 (2017)","journal-title":"J. Global Optim."},{"issue":"5","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1007\/s10878-017-0140-2","volume":"34","author":"Z Wang","year":"2017","unstructured":"Wang, Z., Nip, K.: Bin packing under linear constraints. J. Comb. Optim. 34(5), 1198\u20131209 (2017)","journal-title":"J. Comb. Optim."},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-030-04651-4_21","volume-title":"Combinatorial Optimization and Applications","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Nip, K., Wang, Z.: Related machine scheduling with machine speeds satisfying linear constraints. In: Kim, D., Uma, R.N., Zelikovsky, A. (eds.) COCOA 2018. LNCS, vol. 11346, pp. 314\u2013328. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-04651-4_21"},{"issue":"2","key":"33_CR8","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"33_CR9","series-title":"IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-1-4614-1927-3_19","volume-title":"Mixed-Integer Nonlinear Programming","author":"M K\u00f6ppe","year":"2011","unstructured":"K\u00f6ppe, M.: On the complexity of nonlinear mixed-integer optimization. In: Lee, J., Leyffer, S. (eds.) Mixed-Integer Nonlinear Programming. IMA, vol. 154, pp. 533\u2013558. Springer, Berlin (2011). \nhttps:\/\/doi.org\/10.1007\/978-1-4614-1927-3_19"},{"issue":"2","key":"33_CR10","first-page":"127","volume":"1","author":"I Fagoyinbo","year":"2010","unstructured":"Fagoyinbo, I., Ajibode, I.: Application of linear programming techniques in the effective use of resources for staff training. J. Emerg. Trends Eng. Appl. Sci. 1(2), 127\u2013132 (2010)","journal-title":"J. Emerg. Trends Eng. Appl. Sci."},{"issue":"12","key":"33_CR11","first-page":"132","volume":"3","author":"KM Gupta","year":"2014","unstructured":"Gupta, K.M.: Application of linear programming techniques for staff training. Int. J. Eng. Innov. Technol. 3(12), 132\u2013135 (2014)","journal-title":"Int. J. Eng. Innov. Technol."},{"key":"33_CR12","first-page":"1","volume":"21","author":"LU Uko","year":"2017","unstructured":"Uko, L.U., Lutz, R.J., Weisel, J.A.: An application of linear programming in performance evaluation. Acad. Educ. Lead. J. 21, 1\u20137 (2017)","journal-title":"Acad. Educ. Lead. J."},{"key":"33_CR13","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2006","unstructured":"Kleinberg, J., Tardos, \u00c9.: Algorithm Design. Pearson Education, Incorporated, New York (2006)"},{"key":"33_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"33_CR15","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)"},{"issue":"1 & 2","key":"33_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Nav. Res. Logist. Q. 2(1 & 2), 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"key":"33_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment Problems","author":"R Burkard","year":"2009","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"key":"33_CR18","first-page":"32","volume-title":"History of Mathematical Programming - A Collection of Personal Reminiscences","author":"J Edmonds","year":"1961","unstructured":"Edmonds, J.: A glimpse of heaven. In: Lenstra, J., Kan, A.R., Schrijver, A. (eds.) History of Mathematical Programming - A Collection of Personal Reminiscences, pp. 32\u201354. Centrum Wiskunde & Informatica, Amsterdam (1961)"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"33_CR20","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"3","key":"33_CR21","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"33_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)"},{"issue":"1","key":"33_CR23","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162(1), 439\u2013485 (2005)","journal-title":"Ann. Math."},{"issue":"3","key":"33_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-$$\\epsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"33_CR25","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"2015","unstructured":"Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming. Springer, New York (2015)"},{"key":"33_CR26","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Incorporated, New York (1986)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36412-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:12:21Z","timestamp":1575591141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36412-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030364113","9783030364120"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36412-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoaconference.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}