Letter to the Editor—On the Merit of the Generalized Origin and Restarts in Implicit Enumeration
Author(s) -
Harvey M. Salkin
Publication year - 1970
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.18.3.549
Subject(s) - enumeration , closeness , integer (computer science) , mathematics , tree (set theory) , zero (linguistics) , integer programming , combinatorics , mathematical optimization , computer science , discrete mathematics , mathematical analysis , linguistics , philosophy , programming language
This note discusses the concept of starting a (zero-one) tree search at an integer solution obtained from the associated linear program and restarting it at improved feasible solutions. Computational experience indicates that the length of the enumeration is inversely proportional to the closeness of the origin to the minimal integer vector.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom