DC FieldValueLanguage
dc.contributor.authorHanafi, Saïden
dc.contributor.authorLazić, Jasminaen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-05-02T16:42:09Z-
dc.date.available2020-05-02T16:42:09Z-
dc.date.issued2010-08-01en
dc.identifier.issn1571-0653en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2503-
dc.description.abstractIn this paper we propose a new method for finding an initial feasible solution for Mixed integer programs. We call it "Variable neighborhood pump", since it combines ideas of Variable neighborhood branching and Feasibility pump heuristics. The proposed heuristic was tested on an established set of 83 benchmark problems proven to be difficult to solve to feasibility. The results are compared with those of IBM ILOG CPLEX 11.1, which already includes standard feasibility pump as a primal heuristic. With our approach we managed to obtain better initial objective function values than CPLEX on 63 test instances, within similar average computational time.en
dc.publisherElsevier-
dc.relation.ispartofElectronic Notes in Discrete Mathematicsen
dc.subject0-1 Mixed Integer Programming | Constructive Heuristics | CPLEX | Feasibility Pump | Variable Neighbourhood Searchen
dc.titleVariable neighbourhood pump heuristic for 0-1 mixed integer programming feasibilityen
dc.typeArticleen
dc.identifier.doi10.1016/j.endm.2010.05.096en
dc.identifier.scopus2-s2.0-77954925980en
dc.relation.firstpage759en
dc.relation.lastpage766en
dc.relation.issueCen
dc.relation.volume36en
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

15
checked on Jun 14, 2024

Page view(s)

55
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.