乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T02:17:39Z","timestamp":1712715459655},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1016\/j.ejor.2012.02.011","type":"journal-article","created":{"date-parts":[[2012,2,21]],"date-time":"2012-02-21T15:16:29Z","timestamp":1329837389000},"page":"320-327","source":"Crossref","is-referenced-by-count":11,"title":["Some heuristic methods for solving p-median problems with a coverage constraint"],"prefix":"10.1016","volume":"220","author":[{"given":"Jes\u00fas","family":"S\u00e1ez-Aguado","sequence":"first","affiliation":[]},{"given":"Paula Camelia","family":"Trandafir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2012.02.011_b0005","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0305-0548(85)90011-5","article-title":"A Lagrangean-relaxation method for the constrained assignment problem","volume":"12","author":"Aggarwal","year":"1985","journal-title":"Computers and Operation Research"},{"key":"10.1016\/j.ejor.2012.02.011_b0010","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0305-0548(82)90026-0","article-title":"Minimal spanning tree subject to a side constraint","volume":"9","author":"Aggarwal","year":"1982","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.ejor.2012.02.011_b0015","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s11222-006-8079-7","article-title":"Comparative analysis of modern optimization tools for the p-median problem","volume":"16","author":"Alba","year":"2006","journal-title":"Statistics and Computing"},{"key":"10.1016\/j.ejor.2012.02.011_b0020","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10732-008-9078-y","article-title":"An effective heuristic for large-scale capacitated facility location problems","volume":"15","author":"Avella","year":"2009","journal-title":"Journal of Heuristics"},{"issue":"1","key":"10.1016\/j.ejor.2012.02.011_b0025","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-005-0700-6","article-title":"Computational study of large-scale p-median problems","volume":"109","author":"Avella","year":"2007","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.02.011_b0030","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/opre.1040.0108","article-title":"The optimal diversity management problem","volume":"52","author":"Briant","year":"2004","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2012.02.011_b0035","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","article-title":"A heuristic method for the set covering problem","volume":"47","author":"Caprara","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.02.011_b0040","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.dam.2005.05.026","article-title":"A Lagrangian heuristic algorithm for a real-world train timetabling problem","volume":"154","author":"Caprara","year":"2006","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2012.02.011_b0045","series-title":"Multiobjective Programming and Planning","author":"Cohon","year":"1978"},{"key":"10.1016\/j.ejor.2012.02.011_b0050","series-title":"Network and Discrete Location","author":"Daskin","year":"1995"},{"key":"10.1016\/j.ejor.2012.02.011_b0055","series-title":"Multicriteria Optimization","author":"Ehrgott","year":"2005"},{"key":"10.1016\/j.ejor.2012.02.011_b0060","unstructured":"FICO Team XPRESS Optimization, XPRESS-MP Optimizer Reference Manual, Fair Isaac Corporation, Leam House, 64 Trinity Street, Leamington Spa, Warwickshire CV32 5YN, UK, 2010."},{"key":"10.1016\/j.ejor.2012.02.011_b0065","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/opre.18.2.253","article-title":"Searching for the multiplier in one-constraint optimization problems","volume":"18","author":"Fox","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.02.011_b0070","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579036","article-title":"Lagrangean relaxation","volume":"11","author":"Guignard","year":"2003","journal-title":"TOP"},{"key":"10.1016\/j.ejor.2012.02.011_b0075","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","article-title":"A dual algorithm for the constrained path problem","volume":"10","author":"Handler","year":"1980","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.02.011_b0080","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02614317","article-title":"Cluster analysis and mathematical programming","volume":"79","author":"Hansen","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.02.011_b0085","unstructured":"A. J\u00fcttner, On resource constrained optimization problems, in: 4th Japanese\u2013Hungarian Symposium on Discrete Mathematics and Its Applications, 2005, pp. 1\u201310."},{"key":"10.1016\/j.ejor.2012.02.011_b0090","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems. Part II: the p-medians","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"10.1016\/j.ejor.2012.02.011_b0095","series-title":"Network Routing","first-page":"551","article-title":"Location on networks","volume":"vol. 8","author":"Labbe","year":"1995"},{"key":"10.1016\/j.ejor.2012.02.011_b0100","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","article-title":"The p-median problem: a survey of metaheuristic approaches","volume":"179","author":"Mladenovic","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.011_b0105","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1287\/mnsc.25.4.329","article-title":"Cluster analysis: an application of Lagrangean relaxation","volume":"25","author":"Mulvey","year":"1979","journal-title":"Management Science"},{"key":"10.1016\/j.ejor.2012.02.011_b0110","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/j.ejor.2012.02.011_b0115","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S1366-5545(00)00018-1","article-title":"The fixed charge facility location problem with coverage restrictions","volume":"37","author":"Nozick","year":"2001","journal-title":"Transportation Research Part E"},{"key":"10.1016\/j.ejor.2012.02.011_b0120","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20128","article-title":"Solution methods for the p-median problem: an annotated bibliography","volume":"48","author":"Reese","year":"2006","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2012.02.011_b0125","first-page":"61","article-title":"GRASP: greedy randomized adaptive search procedures. Inteligencia Artificial","volume":"19","author":"Resende","year":"2003","journal-title":"Revista Iberoamericana de Inteligencia Artificial"},{"key":"10.1016\/j.ejor.2012.02.011_b0130","series-title":"Handbook of Metaheuristics","first-page":"219","article-title":"Greedy randomized adaptive search procedures","author":"Resende","year":"2003"},{"key":"10.1016\/j.ejor.2012.02.011_b0135","series-title":"Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX\u20192003)","first-page":"119","article-title":"On the implementation of a swap-based local search procedure for the p-median problem","author":"Resende","year":"2003"},{"key":"10.1016\/j.ejor.2012.02.011_b0140","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","article-title":"A hybrid heuristc for the p-median problem","volume":"10","author":"Resende","year":"2004","journal-title":"Journal of Heuristics"},{"key":"10.1016\/j.ejor.2012.02.011_b0145","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2005.02.046","article-title":"A hybrid multistart heuristic for the uncapacitated facility location problem","volume":"174","author":"Resende","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.011_b0150","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10479-006-0154-0","article-title":"A fast swap-based local search procedure for location problems","volume":"150","author":"Resende","year":"2007","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2012.02.011_b0155","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10479-008-0483-2","article-title":"Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems","volume":"172","author":"S\u00e1ez","year":"2009","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2012.02.011_b0160","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","article-title":"Heuristic methods for estimating the generalized vertex median of a weighted graph","volume":"16","author":"Teitz","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.02.011_b0165","first-page":"95","article-title":"A fast algorithm for the greedy interchange of large-scale clustering and median location problems","volume":"21","author":"Whitaker","year":"1983","journal-title":"INFOR"},{"key":"10.1016\/j.ejor.2012.02.011_b0170","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10479-006-0061-4","article-title":"Solution methods for the bi-objective (cost-coverage) unsconstrained facility location problem with an illustrative example","volume":"147","author":"Villegas","year":"2006","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2012.02.011_b0175","first-page":"63","article-title":"The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization","volume":"2","author":"Xiao","year":"2005","journal-title":"AKCE International Journal of Graphs and Combinatorics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712001282?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712001282?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,25]],"date-time":"2018-11-25T18:59:27Z","timestamp":1543172367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221712001282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S0377221712001282"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.02.011","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}