A Computational Study of Search Strategies for Mixed Integer Programming

Related Items (88)

A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning ⋮ Subadditive approaches in integer programming ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Branching rules revisited ⋮ A partial enumeration algorithm for pure nonlinear integer programming ⋮ BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems ⋮ A survey of variants and extensions of the location-routing problem ⋮ Production flow prototyping subject to imprecise activity specification ⋮ Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems ⋮ A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes ⋮ A branch-cut-and-price algorithm for the piecewise linear transportation problem ⋮ Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ DASH: dynamic approach for switching heuristics ⋮ Full-shipload tramp ship routing and scheduling with variable speeds ⋮ Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information ⋮ Exact algorithms for the double vehicle routing problem with multiple stacks ⋮ Local cuts for mixed-integer programming ⋮ A branch-and-price algorithm for the capacitated facility location problem ⋮ Multivariable Branching: A 0-1 Knapsack Problem Case Study ⋮ New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm ⋮ On learning and branching: a survey ⋮ Decomposition Branching for Mixed Integer Programming ⋮ Computational study of a branching algorithm for the maximum \(k\)-cut problem ⋮ Branch-and-bound solves random binary IPs in poly\((n)\)-time ⋮ A partial outer convexification approach to control transmission lines ⋮ Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs ⋮ A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support ⋮ A nearly optimal randomized algorithm for explorable heap selection ⋮ Compressing branch-and-bound trees ⋮ An exact penalty function method for nonlinear mixed discrete programming problems ⋮ Computing with Multi-row Gomory Cuts ⋮ Orbital branching ⋮ Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ A theoretical and computational analysis of full strong-branching ⋮ Achieving consistency with cutting planes ⋮ A branch and bound algorithm for robust binary optimization with budget uncertainty ⋮ Information-theoretic approaches to branching in search ⋮ BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. ⋮ Foundation-penalty cuts for mixed-integer programs. ⋮ Branching on nonchimerical fractionalities ⋮ Learning Bayesian network structure: towards the essential graph by integer linear programming tools ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ An improved Bernstein global optimization algorithm for MINLP problems with application in process industry ⋮ Optimization Bounds from the Branching Dual ⋮ Computational protein design as an optimization problem ⋮ Strong-branching inequalities for convex mixed integer nonlinear programs ⋮ From feasibility to improvement to proof: three phases of solving mixed-integer programs ⋮ Exact solutions to linear programming problems ⋮ A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design ⋮ An algorithmic framework for convex mixed integer nonlinear programs ⋮ An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space ⋮ Mixed-integer programming techniques for the connected max-\(k\)-cut problem ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem ⋮ Branching on general disjunctions ⋮ Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances ⋮ Experiments with conflict analysis in mixed integer programming ⋮ A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound ⋮ Information-based branching schemes for binary linear mixed integer problems ⋮ A computational study of parametric tabu search for 0-1 mixed integer programs ⋮ A branch-and-cut algorithm for nonconvex quadratic programs with box constraints ⋮ Faster MIP solutions via new node selection rules ⋮ Active-constraint variable ordering for faster feasibility of mixed integer linear programs ⋮ On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem ⋮ Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search ⋮ Tree search algorithm for assigning cooperating UAVs to multiple tasks ⋮ Learning Certifiably Optimal Rule Lists for Categorical Data ⋮ Solving linear programs with complementarity constraints using branch-and-cut ⋮ Improving strong branching by domain propagation ⋮ A power-deficiency and risk-management model for wind farm micro-siting using cyber swarm algorithm ⋮ SCIP: solving constraint integer programs ⋮ Unnamed Item ⋮ Progressively strengthening and tuning MIP solvers for reoptimization ⋮ Efficient semidefinite branch-and-cut for MAP-MRF inference ⋮ Bayesian Inference Using the Proximal Mapping: Uncertainty Quantification Under Varying Dimensionality ⋮ An improved partial enumeration algorithm for integer programming problems ⋮ Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing ⋮ Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances ⋮ Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version ⋮ Exact Solution of Two Location Problems via Branch-and-Bound ⋮ An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting ⋮ A combinatorial branch-and-bound algorithm for box search ⋮ Combinatorial optimization: current successes and directions for the future ⋮ Linearization and parallelization schemes for convex mixed-integer nonlinear optimization ⋮ On a fix-and-relax framework for a class of project scheduling problems ⋮ Airline crew scheduling: state-of-the-art

Uses Software

This page was built for publication: A Computational Study of Search Strategies for Mixed Integer Programming