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

This work introduces a heuristic for mixed integer programming (MIP) problems with binary variables, based on information obtained from differences between feasible solutions as well as solutions from the linear relaxation. This information is used to build a neighborhood that is explored as a sub‐M...

Full description

Bibliographic Details

Published in:	International transactions in operational research Vol. 27; no. 1; pp. 418 - 434
Main Authors:	Maravilha, André L., Carrano, Eduardo G., Campelo, Felipe
Format:	Journal Article
Language:	English
Published:	Oxford Blackwell Publishing Ltd 01.01.2020
Subjects:	branch and bound combinatorial optimization Heuristic Integer programming Linear programming local search Mathematical programming metaheuristics Mixed integer Operations research Polishing
ISSN:	0969-6016, 1475-3995
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!