Improving the efficiency of the Branch and Bound algorithm for integer programming based on “flatness” information-Reference-Cited by-同舟云学术

Improving the efficiency of the Branch and Bound algorithm for integer programming based on “flatness” information

Published:2006-10 Issue:1 Volume:174 Page:92-101
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Derpich Iván,Vera Jorge R.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference22 articles.

1. J.E. Beasly, OR-Library web site. Available from: .

2. Experiments in mixed integer linear programming;Béchinou;Mathematical Programming,1971

3. Branch and bound methods for mathematical programming systems;Beale;Annals of Discrete Mathematics,1979

4. Branch and bound experiments in zero–one programming;Breu;Mathematical Programming,1974

5. A tree search algorithm for mixed integer programming problems;Dakin;Computer Journal,1965

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cost-effectiveness optimization for SO 2 emissions control from coal-fired power plants on a national scale: A case study in China;Journal of Cleaner Production;2017-11

2. Integrated civilian–military pre-positioning of emergency supplies: A multiobjective optimization approach;Applied Soft Computing;2017-09

3. Accelerating the B&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem;Croatian Operational Research Review;2017-03-31

4. Improved branching disjunctions for branch-and-bound: An analytic center approach;European Journal of Operational Research;2015-11

5. Emergency Railway Transportation Planning Using a Hyper-Heuristic Approach;IEEE Transactions on Intelligent Transportation Systems;2015-02