乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T02:12:44Z","timestamp":1717899164754},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,1,16]],"date-time":"2010-01-16T00:00:00Z","timestamp":1263600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s12351-009-0075-1","type":"journal-article","created":{"date-parts":[[2010,1,15]],"date-time":"2010-01-15T06:59:51Z","timestamp":1263538791000},"page":"229-243","source":"Crossref","is-referenced-by-count":6,"title":["A lagrangean decomposition for the maximum independent set problem applied to map labeling"],"prefix":"10.1007","volume":"11","author":[{"given":"Glaydston M.","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Geraldo R.","family":"Mauri","sequence":"additional","affiliation":[]},{"given":"Luiz Antonio N.","family":"Lorena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,16]]},"reference":[{"issue":"3\u20134","key":"75_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"PK Agarwal","year":"1998","unstructured":"Agarwal PK, van Kreveld MJ, Suri S (1998) Label placement by maximum independent set in rectangles. Comput Geom 11(3\u20134):209\u2013218","journal-title":"Comput Geom"},{"issue":"2","key":"75_CR2","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.ejor.2007.10.002","volume":"192","author":"ACF Alvim","year":"2009","unstructured":"Alvim ACF, Taillard ED (2009) Popmusic for the point feature label placement. Eur J Oper Res 192(2):396\u2013413","journal-title":"Eur J Oper Res"},{"issue":"1","key":"75_CR3","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0377-2217(99)00015-6","volume":"121","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk A, Nemhauser GL, Savelsbergh MWP (2000) Conflict graphs in solving integer programming problems. Eur J Oper Res 121(1):40\u201355","journal-title":"Eur J Oper Res"},{"key":"75_CR22","doi-asserted-by":"crossref","unstructured":"Chalermsook P, Chushoy J (2009) Maximum independent set of rectangles. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, New York, pp 892\u2013901","DOI":"10.1137\/1.9781611973068.97"},{"issue":"4","key":"75_CR4","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","volume":"41","author":"P Chardaire","year":"1995","unstructured":"Chardaire P, Sutter A (1995) A decomposition method for quadratic zero-one programming. Manag Sci 41(4):704\u2013712","journal-title":"Manag Sci"},{"key":"75_CR5","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/B978-0-12-336156-1.50064-1","volume-title":"Graphics Gems IV","author":"J Christensen","year":"1994","unstructured":"Christensen J, Marks J, Shieber S (1994). Placing text labels on maps and diagrams. In: Heckbert P (ed) Graphics gems IV. Academic Press, Cambridge, pp 497\u2013504"},{"issue":"3","key":"75_CR6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/212332.212334","volume":"14","author":"J Christensen","year":"1995","unstructured":"Christensen J, Marks J, Shieber S (1995) An empirical study of algorithms for point-feature label placement. ACM Trans Graph 14(3):203\u2013232","journal-title":"ACM Trans Graph"},{"issue":"4","key":"75_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.cageo.2007.01.007","volume":"34","author":"GL Cravo","year":"2008","unstructured":"Cravo GL, Ribeiro GM, Lorena LAN (2008) A greedy randomized adaptive search procedure for the point-feature cartographic label placement. Comput Geosci 34(4):373\u2013386","journal-title":"Comput Geosci"},{"key":"75_CR8","doi-asserted-by":"crossref","unstructured":"Formann M, Wagner F (1991) A packing problem with applications to lettering of maps. In: Proceedings of the Seventh Annual ACM Symposium on Computational Geometry, New Hampshire, pp 281\u2013288","DOI":"10.1145\/109648.109680"},{"key":"75_CR9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"DR Fulkerson","year":"1971","unstructured":"Fulkerson DR (1971) Blocking and anti-blocking pairs of polyhedra. Math Program 1:168\u2013194","journal-title":"Math Program"},{"issue":"4","key":"75_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0966-8349(97)00001-6","volume":"4","author":"RA Gerrard","year":"1996","unstructured":"Gerrard RA, Church RL (1996) Closest assignment constraints and location models: properties and structure. Location Sci 4(4):251\u2013270","journal-title":"Location Sci"},{"issue":"3","key":"75_CR11","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1287\/opre.1040.0169","volume":"53","author":"M Goycoolea","year":"2005","unstructured":"Goycoolea M, Murray AT, Barahona F, Epstein R, Weintraub A (2005) Harvest scheduling subject to maximum area restrictions: exploring exact approaches. Oper Res 53(3):490\u2013500","journal-title":"Oper Res"},{"issue":"2","key":"75_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M Guignard","year":"2003","unstructured":"Guignard M (2003) Lagrangean relaxation. TOP 11(2):151\u2013200","journal-title":"TOP"},{"issue":"6","key":"75_CR13","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held M, Karp RM (1970) The traveling salesman problem and minimum spanning trees. Oper Res 18(6):1138\u20131162","journal-title":"Oper Res"},{"key":"75_CR14","unstructured":"Ilog (2006) CPLEX user\u2019s manual. Version 10.0, France, 478 p"},{"issue":"4","key":"75_CR15","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/4221.4226","volume":"32","author":"RM Karp","year":"1985","unstructured":"Karp RM, Wigderson A (1985) A fast parallel algorithm for the maximal independent set problem. J ACM 32(4):762\u2013773","journal-title":"J ACM"},{"issue":"1","key":"75_CR16","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) Multilevel k-way partitioning scheme for irregular graphs. J Parallel Distrib Comput 48(1):96\u2013129","journal-title":"J Parallel Distrib Comput"},{"key":"75_CR17","unstructured":"Klau GW (2001) A combinatorial approach to orthogonal placement problems. PhD Thesis, Saarlandes University, Saarbr\u00fccken, Germany"},{"issue":"2\u20133","key":"75_CR18","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10107-002-0327-9","volume":"94","author":"GW Klau","year":"2003","unstructured":"Klau GW, Mutzel P (2003) Optimal labeling of point features in rectangular labeling models. Math Program 94(2\u20133):435\u2013458","journal-title":"Math Program"},{"key":"75_CR19","unstructured":"Marks J, Shieber S (1991) The computational complexity of cartographic label placement. Technical Report TR-05-91, Advanced Research in Computing Technology. Harvard University"},{"issue":"1","key":"75_CR20","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0377-2217(98)00038-1","volume":"114","author":"MG Narciso","year":"1999","unstructured":"Narciso MG, Lorena LAN (1999) Lagrangean\/surrogate relaxation for generalized assignment problems. Eur J Oper Res 114(1):165\u2013177","journal-title":"Eur J Oper Res"},{"issue":"1","key":"75_CR21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.jvlc.2006.03.004","volume":"19","author":"HAD Nascimento","year":"2008","unstructured":"Nascimento HAD, Eades P (2008) User hints for map labeling. J Vis Languages Comput 19(1):39\u201374","journal-title":"J Vis Languages Comput"},{"key":"75_CR23","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"MW Padberg","year":"1973","unstructured":"Padberg MW (1973) On the facial structure of set packing polyhedra. Math Program 5:199\u2013215","journal-title":"Math Program"},{"issue":"6","key":"75_CR24","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/j.cageo.2005.10.004","volume":"32","author":"GM Ribeiro","year":"2006","unstructured":"Ribeiro GM, Lorena LAN (2006) Heuristics for cartographic label placement problems. Compu GeoSci 32(6):739\u2013748","journal-title":"Compu GeoSci"},{"issue":"2","key":"75_CR25","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10878-007-9073-5","volume":"15","author":"GM Ribeiro","year":"2008","unstructured":"Ribeiro GM, Lorena LAN (2008a) Column generation approach for the point-feature cartographic label placement problem. J Comb Optim 15(2):147\u2013164","journal-title":"J Comb Optim"},{"issue":"7","key":"75_CR26","doi-asserted-by":"crossref","first-page":"2129","DOI":"10.1016\/j.cor.2006.09.024","volume":"35","author":"GM Ribeiro","year":"2008","unstructured":"Ribeiro GM, Lorena LAN (2008b) Lagrangean relaxation with clusters for point-feature cartographic label placement problems. Compu Oper Res 35(7):2129\u20132140","journal-title":"Compu Oper Res"},{"key":"75_CR27","unstructured":"Sachdeva S (2004) Development of a branch and price approach involving vertex cloning to solve the maximum weighted independent set problem. Master Thesis, A&M University, College Station, Texas"},{"key":"75_CR28","unstructured":"Strijk T, Verweij B, Aardal K (2000) Algorithms for maximum independent set applied to map labeling. Technical Report UU-CS-2000-22, Universiteit Utrecht, Nederland"},{"key":"75_CR29","first-page":"613","volume-title":"Essays and survey in metaheuristics","author":"E Taillard","year":"2001","unstructured":"Taillard E, Voss S (2001) POPMUSIC: partial optimization metaheuristic under special intensification conditions. In: Ribeiro C, Hansen P (eds) Essays and survey in metaheuristics. Kluwer Academic Publishers, Boston, pp 613\u2013629"},{"issue":"3","key":"75_CR30","first-page":"266","volume":"9","author":"OV Verner","year":"1997","unstructured":"Verner OV, Wainwright RL, Schoenefeld DA (1997) Placing text labels on maps and diagrams using genetic algorithms with masking. J Compu 9(3):266\u2013275","journal-title":"J Compu"},{"key":"75_CR31","doi-asserted-by":"crossref","unstructured":"Verweij B, Aardal K (1999) An optimisation algorithm for maximum independent set with applications in map labelling. In: Nesetril J (ed) Proceedings of the 7th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol 1643, pp 426\u2013437","DOI":"10.1007\/3-540-48481-7_37"},{"key":"75_CR33","doi-asserted-by":"crossref","unstructured":"Wagner F, Wolff A (1998) A combinatorial framework for map labeling. In: Whitesides SH (ed) Proceedings of the 6th International Symposium on Graph Drawing, Lecture Notes in Computer Science, vol 1547, pp 316\u2013331","DOI":"10.1007\/3-540-37623-2_24"},{"issue":"2","key":"75_CR32","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s00453-001-0009-7","volume":"30","author":"F Wagner","year":"2001","unstructured":"Wagner F, Wolff A, Kapoor V, Strijk T (2001) Three rules suffice for good label placement. Algorithmica 30(2):334\u2013349","journal-title":"Algorithmica"},{"issue":"4","key":"75_CR34","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1002\/net.20088","volume":"46","author":"D Warrier","year":"2005","unstructured":"Warrier D, Wilhelm WE, Warren JS, Hicks IV (2005) A branch-and-price approach for the maximum weight independent set problem. Networks 46(4):198\u2013209","journal-title":"Networks"},{"key":"75_CR35","unstructured":"Wolff A (1999) Automated label placement in theory and practice. PhD Thesis, Fachbereich Mathematik und Informatik, Freie Universit\u00e4t Berlin"},{"key":"75_CR36","unstructured":"Wolff A, Strijk T (1996) The map-labeling bibliography. Available at http:\/\/www.i11.ira.uka.de\/map-labeling\/bibliography . Accessed 22 Dec 2008"},{"issue":"1","key":"75_CR37","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1013720231747","volume":"6","author":"M Yamamoto","year":"2002","unstructured":"Yamamoto M, C\u00e2mara G, Lorena LAN (2002) Tabu search heuristic for point-feature cartographic label placement. GeoInformatica 6(1):77\u201390","journal-title":"GeoInformatica"},{"key":"75_CR38","first-page":"285","volume-title":"Metaheuristics: progress as real problem solvers","author":"M Yamamoto","year":"2005","unstructured":"Yamamoto M, Lorena LAN (2005) A constructive genetic approach to point-feature cartographic label placement. In: Ibaraki T, Nonobe K, Yagiura M (eds) Metaheuristics: progress as real problem solvers. Springer, Berlin, pp 285\u2013300"},{"issue":"5","key":"75_CR39","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1287\/opre.38.5.752","volume":"38","author":"S Zoraster","year":"1990","unstructured":"Zoraster S (1990) The solution of large 0\u20131 integer programming problems encountered in automated cartography. Oper Res 38(5):752\u2013759","journal-title":"Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-009-0075-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-009-0075-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-009-0075-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T04:04:34Z","timestamp":1559448274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-009-0075-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,16]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["75"],"URL":"https:\/\/doi.org\/10.1007\/s12351-009-0075-1","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,16]]}}}