Affiliation:
1. Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA
2. Department of Electrical Enigneering, Princeton University, Princeton, New Jersey
Abstract
Branch-and-bound implicit enumeration algorithms for permutation problems (discrete optimization problems where the set of feasible solutions is the permutation group
S
n
) are characterized in terms of a sextuple (
B
p
S,E,D,L,U
), where (1)
B
p
is the branching rule for permutation problems, (2)
S
is the next node selection rule, (3)
E
is the set of node elimination rules, (4)
D
is the node dominance function, (5)
L
is the node lower-bound cost function, and (6)
U
is an upper-bound solution cost. A general algorithm based on this characterization is presented and the dependence of the computational requirements on the choice of algorithm parameters,
S, E, D, L,
and
U
is investigated theoretically. The results verify some intuitive notions but disprove others.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference16 articles.
1. Optimum seeking with branch and bound;Manag. Sci. I~,1966
2. A note on the branch-and-bound principle;L~s E;Opcr. Res.,1968
3. The Expression of Algorithms by Charts
4. Fox B. L. AND SCHRAGE L.E. The value of various strategies in branch-and-bound. Unpublished rep. June 1972. Fox B. L. AND SCHRAGE L.E. The value of various strategies in branch-and-bound. Unpublished rep. June 1972.
5. Integer programming algorithms: A framework and state of the art survey;Manag. Sci. I8,1972
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献