{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:00:27Z","timestamp":1743130827275,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319573502"},{"type":"electronic","value":"9783319573519"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57351-9_16","type":"book-chapter","created":{"date-parts":[[2017,4,10]],"date-time":"2017-04-10T15:08:53Z","timestamp":1491836933000},"page":"117-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization"],"prefix":"10.1007","author":[{"given":"Jianmei","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Blais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Czarnecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"van Beek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,11]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems","author":"P Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer, Dordrecht (2001)"},{"key":"16_CR2","unstructured":"Bj\u00f8rner, N., Phan, A.D.: $$\\nu $$ \u03bd Z - maximal satisfaction with Z3. In: Proceedings of the SCSS, pp. 632\u2013647 (2014)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Fremont, D.J., Meel, K.S., Seshia, S.A., Vardi, M.Y.: Distribution-aware sampling and weighted model counting for SAT. In: Proceedings of the AAAI, pp. 1722\u20131730 (2014)","DOI":"10.1609\/aaai.v28i1.8990"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-642-39799-8_40","volume-title":"Computer Aided Verification","author":"S Chakraborty","year":"2013","unstructured":"Chakraborty, S., Meel, K.S., Vardi, M.Y.: A scalable and nearly uniform generator of SAT witnesses. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 608\u2013623. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39799-8_40"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Meel, K.S., Vardi, M.Y.: Balancing scalability and uniformity in sat witness generator. In: Proceedings of the DAC, pp. 1\u20136 (2014)","DOI":"10.1145\/2593069.2593097"},{"key":"16_CR6","unstructured":"Dechter, R., Kask, K., Bin, E., Emek, R.: Generating random solutions for constraint satisfaction problems. In: Proceedings of the AAAI, pp. 15\u201321 (2002)"},{"key":"16_CR7","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Heidelberg (2005)","edition":"2"},{"key":"16_CR8","unstructured":"Gavanelli, M.: An algorithm for multi-criteria optimization in CSPs. In: Proceedings of the ECAI, pp. 136\u2013140 (2002)"},{"key":"16_CR9","unstructured":"Gomes, C., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proceedings of the AAAI, pp. 431\u2013437 (1998)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Near-uniform sampling of combinatorial spaces using XOR constraints. In: Proceedings of the NIPS, pp. 481\u2013488 (2006)","DOI":"10.7551\/mitpress\/7503.003.0065"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Hartert, R., Schaus, P.: A support-based algorithm for the bi-objective pareto constraint. In: Proceedings of the AAAI, pp. 2674\u20132679 (2014)","DOI":"10.1609\/aaai.v28i1.9119"},{"key":"16_CR12","unstructured":"Le Pape, C., Couronn\u00e9, P., Vergamini, D., Gosselin, V.: Time-versus-capacity compromises in project scheduling. In: Proceedings of the Thirteenth Workshop of the UK Planning Special Interest Group, Strathclyde, UK (1994)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-72788-0_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"M Lukasiewycz","year":"2007","unstructured":"Lukasiewycz, M., Gla\u00df, M., Haubelt, C., Teich, J.: Solving multi-objective Pseudo-Boolean problems. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 56\u201369. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72788-0_9"},{"key":"16_CR14","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C Papadimitriou","year":"1998","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, Mineola (1998)"},{"key":"16_CR15","unstructured":"Rayside, D., Estler, H.C., Jackson, D.: The guided improvement algorithm for exact, general purpose, many-objective combinatorial optimization. Technical report, MIT-CSAIL-TR-2009-033 (2009)"},{"volume-title":"Handbook of Constraint Programming","year":"2006","key":"16_CR16","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(95)00098-4","volume":"86","author":"N Sadeh","year":"1996","unstructured":"Sadeh, N., Fox, M.: Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artif. Intell. 86(1), 1\u201341 (1996)","journal-title":"Artif. Intell."},{"issue":"3","key":"16_CR18","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D Spielman","year":"2004","unstructured":"Spielman, D., Teng, S.H.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J. ACM 51(3), 385\u2013463 (2004)","journal-title":"J. ACM"},{"key":"16_CR19","volume-title":"Constraint Satisfaction in Logic Programming","author":"P Hentenryck Van","year":"1989","unstructured":"Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (1989)"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0377-2217(80)90038-7","volume":"4","author":"L Wassenhove van","year":"1980","unstructured":"van Wassenhove, L., Gelders, L.: Solving a bicriterion scheduling problem. Eur. J. Oper. Res. 4(1), 42\u201348 (1980)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57351-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T02:35:12Z","timestamp":1692758112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57351-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319573502","9783319573519"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57351-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"11 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Canadian AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canadian Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"canadianai2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aigicrv.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}