The ray-method: theoretical background and computational results
From MaRDI portal
Publication:2966413
zbMATH Open1357.90092MaRDI QIDQ2966413FDOQ2966413
Authors: A. Racz, Erik Bajalinov
Publication date: 7 March 2017
Recommendations
- Determining initial bound by ``ray-method in branch and bound procedure
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- Incumbent solutions in branch-and-bound algorithms: Setting the record straight
- A method to improve integer linear programming problem with branch-and-bound procedure
- Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
Fractional programming (90C32) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cited In (5)
Uses Software
This page was built for publication: The ray-method: theoretical background and computational results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2966413)