A Hybrid Branch-and-Bound Approach for Exact Rational Mixed-Integer Programming (original) (raw)
Related papers
A Computational Status Update for Exact Rational Mixed Integer Programming
2021
Modern branch-and-cut solvers for Mixed-Integer Linear Programming: a computational comparison
2015
Explicit-Constraint Branching for Solving Mixed-Integer Programs
Operations Research/Computer Science Interfaces Series, 2000
Improved branch and bound algorithm with a comparison between different LP solvers
2010 9th IEEE/IAS International Conference on Industry Applications, INDUSCON 2010, 2010
Computational advances in solving Mixed Integer Linear Programming problems
2018
Dippy: A Simplified Interface for Advanced Mixed-integer Programming
2011
An Improved Branch and Bound Algorithm for Mixed Integer Nonlinear Programs
Computers & Operations Research, 1994
Narrow Gauge and Analytical Branching Strategies for Mixed Integer Programming
2015
A Novel TRUST-TECH Guided Branch-and-Bound Method for Nonlinear Integer Programming
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2015
FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs
2010
Using an interior point method in a branch and bound algorithm for integer programming July
2007
International Journal of Mathematical, Engineering and Management Sciences
Mixed Integer Linear Programming Formulation Techniques
SIAM Review, 2015
Using An Interior Point Method In a Branch and Bound Algorithm for Integer Programming
RPI Mathematical Report
Restrict-and-relax search for 0-1 mixed-integer programs
An Interactive Branch and Bound Procedure for Multicriterion Integer Linear Programming
Lecture Notes in Economics and Mathematical Systems, 1980
Solution of Mixed-Integer Programming Problems on the XT5
2009
Automated Configuration of Mixed Integer Programming Solvers
Frank Hutter, Kevin Leyton-brown, Holger Hoos
Lecture Notes in Computer Science, 2010
A method to improve integer linear programming problem with branch-and-bound procedure
Applied Mathematics and Computation, 2006
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
Mathematical Programming, 2007
Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends
arXiv (Cornell University), 2021
Computers & Operations Research, 1997
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
INFORMS Journal on Computing, 2000
Improved Branch and Bound Algorithms for Integer Programming
1992
Modular Optimizer for Mixed Integer Programming MOMIP Version 2.1
1994
Constraint Integer Programming: A New Approach to Integrate CP and MIP
Lecture Notes in Computer Science, 2008
Solving linear multiplicative programs via branch-and-bound: a computational experience
Computational Management Science
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Computers & Operations Research, 2011
Modular Optimizer for Mixed Integer Programming MOMIP Version 2.3
1996
Solving Hard Mixed Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
Surrogate duality in a branch-and-bound procedure for integer programming
European Journal of Operational Research, 1988
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Lecture Notes in Computer Science, 2010
AN ALGORITHM FOR SOLVING INTEGER LINEAR PROGRAMMING PROBLEMS