A Computational Study of Search Strategies for Mixed Integer Programming

Authors:
J. T. Linderoth;M. W. P. Savelsbergh
Affiliations:
-;-
Venue:
INFORMS Journal on Computing
Year:
1999

Citing 0
Cited 29

Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching

Computational Optimization and Applications
An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A Novel Approach for Composing Test Sheets from Large Item Banks to Meet Multiple Assessment Criteria

ICALT '05 Proceedings of the Fifth IEEE International Conference on Advanced Learning Technologies
An effective approach for test-sheet composition with large-scale item banks

Computers & Education
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria

INFORMS Journal on Computing
Mixed-integer nonlinear programming: some modeling and solution issues

IBM Journal of Research and Development - Business optimization
A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs

International Journal of Computational Science and Engineering
An innovative parallel test sheet composition approach to meet multiple assessment criteria for national tests

Computers & Education
An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints

Operations Research
Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version

Computers and Operations Research
An effective approach for test-sheet composition with large-scale item banks

Computers & Education
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances

Journal of Scheduling
Faster MIP solutions via new node selection rules

Computers and Operations Research
Computing with multi-row gomory cuts

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An automatic group composition system for composing collaborative learning groups using enhanced particle swarm optimization

Computers & Education
FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs

INFORMS Journal on Computing
On the Complexity of Selecting Disjunctions in Integer Programming

SIAM Journal on Optimization
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem

Computers and Operations Research
An integer programming and decomposition approach to general chance-constrained mathematical programs

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Exact solutions to linear programming problems

Operations Research Letters
Information-theoretic approaches to branching in search

Discrete Optimization
An algorithmic framework for convex mixed integer nonlinear programs

Discrete Optimization
An improved algorithm for computing Steiner minimal trees in Euclidean d-space

Discrete Optimization
Foundation-penalty cuts for mixed-integer programs

Operations Research Letters
Branching rules revisited

Operations Research Letters
A personalized e-course composition based on a genetic algorithm with forcing legality in an adaptive learning system

Journal of Network and Computer Applications
On branching rules for convex mixed-integer nonlinear optimization

Journal of Experimental Algorithmics (JEA)
Backdoor Branching

INFORMS Journal on Computing
Learning Bayesian network structure: Towards the essential graph by integer linear programming tools

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The branch-and-bound procedure for solving mixed integer programming (MIP) problems using linear programming relaxations has been used with great success for decades. Over the years, a variety of researchers have studied ways of making the basic algorithm more effective. Breakthroughs in the fields of computer hardware, computer software, and mathematics have led to increasing success at solving larger and larger MIP instances. The goal of this article is to survey many of the results regarding branch-and-bound search strategies and evaluate them again in light of the other advances that have taken place over the years. In addition, novel search strategies are presented and shown to often perform better than those currently used in practice.