@article{
 title = {Metaheuristics for the linear ordering problem with cumulative costs},
 type = {article},
 year = {2012},
 identifiers = {[object Object]},
 keywords = {Combinatorial optimization,Linear ordering problem,Metaheuristics},
 pages = {270-277},
 volume = {216},
 websites = {http://linkinghub.elsevier.com/retrieve/pii/S0377221711006680},
 month = {1},
 publisher = {Elsevier B.V.},
 id = {898b02c3-533a-34c3-a692-918d921b980c},
 created = {2015-03-23T18:50:20.000Z},
 accessed = {2014-09-12},
 file_attached = {true},
 profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},
 group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},
 last_modified = {2017-03-14T11:36:44.206Z},
 read = {true},
 starred = {false},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {Duarte2012a},
 private_publication = {false},
 abstract = {The linear ordering problem with cumulative costs (LOPCC) is a variant of the well-known linear ordering problem, in which a cumulative propagation makes the objective function highly non-linear. The LOPCC has been recently introduced in the context of mobile-phone telecommunications. In this paper we propose two metaheuristic methods for this NP-hard problem. The first one is based on the GRASP methodology, while the second one implements an Iterated Greedy-Strategic Oscillation procedure. We also propose a post-processing based on Path Relinking to obtain improved outcomes. We compare our methods with the state-of-the-art procedures on a set of 218 previously reported instances. The comparison favors the Iterated Greedy - Strategic Oscillation with the Path Relinking post-processing, which is able to identify 87 new best objective function values. © 2011 Elsevier B.V. All rights reserved.},
 bibtype = {article},
 author = {Duarte, Abraham and Martí, Rafael and Álvarez, Ada and Ángel-Bello, Francisco},
 journal = {European Journal of Operational Research},
 number = {2}
}

{"_id":{"_str":"53cec495299afbd631000e89"},"__v":1,"authorIDs":[],"author_short":["Duarte, A.","Martí, R.","Álvarez, A.","Ángel-Bello, F."],"bibbaseid":"duarte-mart-lvarez-ngelbello-metaheuristicsforthelinearorderingproblemwithcumulativecosts-2012","bibdata":{"title":"Metaheuristics for the linear ordering problem with cumulative costs","type":"article","year":"2012","identifiers":"[object Object]","keywords":"Combinatorial optimization,Linear ordering problem,Metaheuristics","pages":"270-277","volume":"216","websites":"http://linkinghub.elsevier.com/retrieve/pii/S0377221711006680","month":"1","publisher":"Elsevier B.V.","id":"898b02c3-533a-34c3-a692-918d921b980c","created":"2015-03-23T18:50:20.000Z","accessed":"2014-09-12","file_attached":"true","profile_id":"756a70ce-605d-3e50-9cbb-a99c29afcbe8","group_id":"1f5b486a-d8ac-3a35-9104-56111360dab7","last_modified":"2017-03-14T11:36:44.206Z","read":"true","starred":false,"authored":false,"confirmed":"true","hidden":false,"citation_key":"Duarte2012a","private_publication":false,"abstract":"The linear ordering problem with cumulative costs (LOPCC) is a variant of the well-known linear ordering problem, in which a cumulative propagation makes the objective function highly non-linear. The LOPCC has been recently introduced in the context of mobile-phone telecommunications. In this paper we propose two metaheuristic methods for this NP-hard problem. The first one is based on the GRASP methodology, while the second one implements an Iterated Greedy-Strategic Oscillation procedure. We also propose a post-processing based on Path Relinking to obtain improved outcomes. We compare our methods with the state-of-the-art procedures on a set of 218 previously reported instances. The comparison favors the Iterated Greedy - Strategic Oscillation with the Path Relinking post-processing, which is able to identify 87 new best objective function values. © 2011 Elsevier B.V. All rights reserved.","bibtype":"article","author":"Duarte, Abraham and Martí, Rafael and Álvarez, Ada and Ángel-Bello, Francisco","journal":"European Journal of Operational Research","number":"2","bibtex":"@article{\n title = {Metaheuristics for the linear ordering problem with cumulative costs},\n type = {article},\n year = {2012},\n identifiers = {[object Object]},\n keywords = {Combinatorial optimization,Linear ordering problem,Metaheuristics},\n pages = {270-277},\n volume = {216},\n websites = {http://linkinghub.elsevier.com/retrieve/pii/S0377221711006680},\n month = {1},\n publisher = {Elsevier B.V.},\n id = {898b02c3-533a-34c3-a692-918d921b980c},\n created = {2015-03-23T18:50:20.000Z},\n accessed = {2014-09-12},\n file_attached = {true},\n profile_id = {756a70ce-605d-3e50-9cbb-a99c29afcbe8},\n group_id = {1f5b486a-d8ac-3a35-9104-56111360dab7},\n last_modified = {2017-03-14T11:36:44.206Z},\n read = {true},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n citation_key = {Duarte2012a},\n private_publication = {false},\n abstract = {The linear ordering problem with cumulative costs (LOPCC) is a variant of the well-known linear ordering problem, in which a cumulative propagation makes the objective function highly non-linear. The LOPCC has been recently introduced in the context of mobile-phone telecommunications. In this paper we propose two metaheuristic methods for this NP-hard problem. The first one is based on the GRASP methodology, while the second one implements an Iterated Greedy-Strategic Oscillation procedure. We also propose a post-processing based on Path Relinking to obtain improved outcomes. We compare our methods with the state-of-the-art procedures on a set of 218 previously reported instances. The comparison favors the Iterated Greedy - Strategic Oscillation with the Path Relinking post-processing, which is able to identify 87 new best objective function values. © 2011 Elsevier B.V. All rights reserved.},\n bibtype = {article},\n author = {Duarte, Abraham and Martí, Rafael and Álvarez, Ada and Ángel-Bello, Francisco},\n journal = {European Journal of Operational Research},\n number = {2}\n}","author_short":["Duarte, A.","Martí, R.","Álvarez, A.","Ángel-Bello, F."],"urls":{"Paper":"https://bibbase.org/service/mendeley/756a70ce-605d-3e50-9cbb-a99c29afcbe8/file/51351256-0f0f-0399-2bb6-f77afee9ba34/2012-Metaheuristics_for_the_linear_ordering_problem_with_cumulative_costs.pdf.pdf","Website":"http://linkinghub.elsevier.com/retrieve/pii/S0377221711006680"},"bibbaseid":"duarte-mart-lvarez-ngelbello-metaheuristicsforthelinearorderingproblemwithcumulativecosts-2012","role":"author","keyword":["Combinatorial optimization","Linear ordering problem","Metaheuristics"],"downloads":0},"bibtype":"article","biburl":null,"creationDate":"2014-07-22T20:07:49.360Z","downloads":0,"keywords":["pisis","combinatorial optimization","linear ordering problem","metaheuristics"],"search_terms":["metaheuristics","linear","ordering","problem","cumulative","costs","duarte","martí","álvarez","ángel-bello"],"title":"Metaheuristics for the linear ordering problem with cumulative costs","year":2012}