Improving the efficiency of the Branch and Bound algorithm for integer programming based on “flatness” information (original) (raw)
Related papers
Croatian Operational Research Review
A Note on Branch and Bound Algorithm for Integer Linear Programming
Current Journal of Applied Science and Technology
A method to improve integer linear programming problem with branch-and-bound procedure
Applied Mathematics and Computation, 2006
Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends
arXiv (Cornell University), 2021
Improved Branch and Bound Algorithms for Integer Programming
1992
International Journal of Mathematical, Engineering and Management Sciences
Faster integer-feasibility in mixed-integer linear programs by branching to force change
Computers & Operations Research, 2011
Discovering Branching Rules for Mixed Integer Programming by Computational Intelligence
2015
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
Lecture Notes in Computer Science
Information-based branching schemes for binary linear mixed integer problems
Mathematical Programming Computation, 2009
A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
Operations Research Letters, 2012
An Interactive Branch and Bound Procedure for Multicriterion Integer Linear Programming
Lecture Notes in Economics and Mathematical Systems, 1980
A branch-and-cut technique to solve multiobjective integer quadratic programming problems
Annals of Operations Research, 2017
Narrow Gauge and Analytical Branching Strategies for Mixed Integer Programming
2015
An Improved Branch and Bound Algorithm for Mixed Integer Nonlinear Programs
Computers & Operations Research, 1994
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
INFORMS Journal on Computing, 2000
polymake in Linear and Integer Programming
NEW METHODS FOR BRANCH-AND-BOUND ALGORITHMS
Explicit-Constraint Branching for Solving Mixed-Integer Programs
Operations Research/Computer Science Interfaces Series, 2000
Using an interior point method in a branch and bound algorithm for integer programming July
2007
On the Complexity of Selecting Branching Disjunction in Integer Programming
2008
AN ALGORITHM FOR SOLVING INTEGER LINEAR PROGRAMMING PROBLEMS
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics, 2002
Cutting planes for branch‐and‐price algorithms
2011
Journal of Heuristics, 2001
Using An Interior Point Method In a Branch and Bound Algorithm for Integer Programming
RPI Mathematical Report
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Lecture Notes in Computer Science, 2006
Conjunctive Cuts for Integer Programs
Computational results with a branch-and-bound algorithm for the general knapsack problem
Naval Research Logistics Quarterly, 1979