A recombination-based matheuristic for mixed integer programming problems with binary variables-Reference-Cited by-同舟云学术

A recombination-based matheuristic for mixed integer programming problems with binary variables

Published:2018-03-23 Issue:1 Volume:27 Page:418-434
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Maravilha André L.¹²^ORCID,Carrano Eduardo G.³²,Campelo Felipe³²^ORCID

Affiliation:

1. Graduate Program in Electrical Engineering; Universidade Federal de Minas Gerais; Belo Horizonte 31270-010 MG Brazil

2. Operations Research and Complex Systems Laboratory (ORCS Lab); Belo Horizonte 31270-010 MG Brazil

3. Department of Electrical Engineering; Universidade Federal de Minas Gerais; Belo Horizonte 31270-010 MG Brazil

Funder

Fundação de Amparo à Pesquisa do Estado de Minas Gerais

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/itor.12526/fullpdf

Reference25 articles.

1. A survey of very large-scale neighborhood search techniques;Ahuja;Discrete Applied Mathematics,2002

2. Ahuja , R.K. Orlin , J.B. Sharma , D. 1999 New neighborhood search structures for the capacitated minimum spanning tree problem Department of Industrial & Systems Engineering, University of Florida

3. RENS: the optimal rounding;Berthold;Mathematical Programming Computation,2014

4. Birattari , M. 2004 On the estimation of the expected performance of a metaheuristic on a class of instances: how many instances, how many runs? IRIDIA-Université Libre de Bruxelles

5. The R Book