{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:29:33Z","timestamp":1649046573952},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,4,22]],"date-time":"2014-04-22T00:00:00Z","timestamp":1398124800000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10288-014-0259-2","type":"journal-article","created":{"date-parts":[[2014,4,21]],"date-time":"2014-04-21T13:25:42Z","timestamp":1398086742000},"page":"379-401","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Davidson College multi-objective assignment problem: a case study"],"prefix":"10.1007","volume":"12","author":[{"given":"Timothy P.","family":"Chartier","sequence":"first","affiliation":[]},{"given":"Victoria","family":"Ellison","sequence":"additional","affiliation":[]},{"given":"Amy N.","family":"Langville","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,22]]},"reference":[{"key":"259_CR1","first-page":"123","volume":"53","author":"CP Bao","year":"2007","unstructured":"Bao CP, Tsai MC, Tsai MI (2007) A new approach to study the multi-objective assignment problem. WHAMPOA-An Interdiscip J 53:123\u2013132","journal-title":"WHAMPOA-An Interdiscip J"},{"key":"259_CR2","doi-asserted-by":"crossref","unstructured":"Bayati M, Gleich D, Saber A, Wang Y (2013) Message passing algorithms for sparse network alignment. ACM Trans Knowl Discov Data 7(1), 3\u201331","DOI":"10.1145\/2435209.2435212"},{"key":"259_CR3","doi-asserted-by":"crossref","unstructured":"Burkard R, Dell\u2019Amico M, Martello S (2009) Assignment problems. SIAM, Philadelphia","DOI":"10.1137\/1.9780898717754"},{"key":"259_CR4","unstructured":"Chavey DP, Campbell PJ, Straffin PD, Professor\u2019s Commentary (1994) The politics of course time slots. UMAP J COMAP 15(2):123\u2013136"},{"key":"259_CR5","volume-title":"Applied integer programming","author":"D-S Chen","year":"2010","unstructured":"Chen D-S, Batson RG, Dang Y (2010) Applied integer programming. Wiley, New York"},{"key":"259_CR6","volume-title":"In pursuit of the traveling salesman","author":"WJ Cook","year":"2012","unstructured":"Cook WJ (2012) In pursuit of the traveling salesman. Princeton University Press, Princeton, NJ"},{"key":"259_CR7","unstructured":"Emrah BE, Edis RS (2013) An integer programming model for the conference timetabling problem. C.B.U. J Sci 9(2):55\u201362"},{"issue":"2","key":"259_CR8","first-page":"115","volume":"15","author":"T Franklin","year":"1994","unstructured":"Franklin T, Jenkins E-W, Woodson K (1994) A case study in scheduling courses. UMAP J COMAP 15(2):115\u2013122","journal-title":"UMAP J COMAP"},{"key":"259_CR9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale D, Shapely L (1962) College admissions and the stability of marriage. Am Math Mon 69:9\u201315","journal-title":"Am Math Mon"},{"issue":"1","key":"259_CR10","first-page":"109","volume":"19","author":"F Glover","year":"1998","unstructured":"Glover F, Kuo C-C, Dhir KS (1998) Heuristic algorithms for the maximum diversity problem. J Inf Optim Sci 19(1):109\u2013132","journal-title":"J Inf Optim Sci"},{"key":"259_CR11","volume-title":"The stable marriage problem: structure and algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield D, Irving RW (1989) The stable marriage problem: structure and algorithms. MIT Press, Cambridge, MA"},{"key":"259_CR12","unstructured":"Gueret C, Prins C, Sevaux M, Heipcke S (2002) Applications of optimization with XpressMP. Dash Optimization Blisworth, UK"},{"issue":"6","key":"259_CR13","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1111\/j.1540-5915.1993.tb00509.x","volume":"24","author":"C-C Kuo","year":"1993","unstructured":"Kuo C-C, Glover F, Dhir KS (1993) Analyzing and modeling the maximum diversity problem by zero? One programming. Decis Sci 24(6):1171\u20131185","journal-title":"Decis Sci"},{"key":"259_CR14","doi-asserted-by":"crossref","unstructured":"Langville AN, Pedings K, Yamamoto Y (2012) A minimum violations ranking method. Optim Eng 13(2), 349\u2013370","DOI":"10.1007\/s11081-011-9135-5"},{"issue":"6","key":"259_CR15","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26(6):369\u2013395","journal-title":"Struct Multidiscip Optim"},{"issue":"1","key":"259_CR16","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","volume":"200","author":"R Mart","year":"2010","unstructured":"Mart R, Gallego M, Duarte A (2010) A branch and bound algorithm for the maximum diversity problem. Eur J Oper Res 200(1):36\u201344","journal-title":"Eur J Oper Res"},{"key":"259_CR17","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1999","unstructured":"Nemhauser GL, Wolsey LA (1999) Integer and combinatorial optimization, 1st edn. Wiley-Interscience, New York","edition":"1"},{"issue":"3\u20134","key":"259_CR18","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s11127-006-9126-9","volume":"131","author":"RF Potthoff","year":"2007","unstructured":"Potthoff RF, Brams SJ (2007) Scheduling of panels by integer programming: results for the 2005 and 2006 New Orleans meetings. Public Choice 131(3\u20134):465\u20138","journal-title":"Public Choice"},{"key":"259_CR19","volume-title":"Optimization in operations research","author":"RL Rardin","year":"1997","unstructured":"Rardin RL (1997) Optimization in operations research. Prentice Hall, Englewood Cliffs, NJ"},{"issue":"4","key":"259_CR20","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1257\/aer.89.4.748","volume":"89","author":"A Roth","year":"1999","unstructured":"Roth A, Peranson E (1999) The redesign of the matching market for American physicians: some engineering aspects of economic design. Am Econ Rev 89(4):748\u2013780","journal-title":"Am Econ Rev"},{"key":"259_CR21","volume-title":"Two-sided matching: a study in game-theoretic modeling and analysis","author":"A Roth","year":"1992","unstructured":"Roth A, Sotomayor M (1992) Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge University Press, Cambridge, MA"},{"key":"259_CR22","volume-title":"Decision making for leaders: the analytic hierarchy process for decisions in a complex world","author":"TL Saaty","year":"2008","unstructured":"Saaty TL (2008) Decision making for leaders: the analytic hierarchy process for decisions in a complex world. RWS Publications, Pittsburgh, PA"},{"issue":"3","key":"259_CR23","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1111\/j.1937-5956.2004.tb00506.x","volume":"13","author":"SE Sampson","year":"2004","unstructured":"Sampson SE (2004) Practical implications of preference-based conference scheduling. Prod Opera Manag 13(3):205\u201315","journal-title":"Prod Opera Manag"},{"key":"259_CR24","volume-title":"Linear goal programming","author":"MJ Schniederjans","year":"1984","unstructured":"Schniederjans MJ (1984) Linear goal programming. Petrocelli, Princeton, NJ"},{"issue":"4","key":"259_CR25","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10732-007-9010-x","volume":"13","author":"GC Silva","year":"2007","unstructured":"Silva GC et al (2007) New heuristics for the maximum diversity problem. J Heuristics 13(4):315\u2013336","journal-title":"J Heuristics"},{"key":"259_CR26","volume-title":"Operations research","author":"HA Taha","year":"2006","unstructured":"Taha HA (2006) Operations research, 8th edn. Prentice Hall, Englewood Cliffs, NJ","edition":"8"},{"key":"259_CR27","volume-title":"Model building in mathematical programming","author":"HP William","year":"1999","unstructured":"William HP (1999) Model building in mathematical programming, 4th edn. Wiley, New York","edition":"4"},{"key":"259_CR28","volume-title":"Integer programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey LA (1998) Integer programming. Wiley, New York"},{"issue":"1","key":"259_CR29","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1287\/inte.33.1.5.12720","volume":"33","author":"G Yu","year":"2003","unstructured":"Yu G, Arguello M, Song G, McCowan SM, White A (2003) A new era for crew recovery at continental airlines. Interfaces 33(1):5\u201322","journal-title":"Interfaces"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-014-0259-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-014-0259-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-014-0259-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:59Z","timestamp":1559131979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-014-0259-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,22]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["259"],"URL":"https:\/\/doi.org\/10.1007\/s10288-014-0259-2","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,22]]}}}