Branch and Bound Methods for Mathematical Programming Systems

DOI10.1016/S0167-5060(08)70351-0MaRDI QIDQ4191855zbMATH OpenOpenAlexFDO

Authors E. M. L. Beale

Publication date 1979

Published in Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70351-0

zbMATH Keywords

Branch and Bound AlgorithmsInteger ProgrammingLinked Ordered SetsNonconvex ProgrammingResearch SurveySpecial Ordered Sets of Variables

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10)

Cited in

(30)

• Representability in mixed integer programming. I: Characterization results
• A possible way to reduce degeneracy in integer programming computations
• A simplification for some disjunctive formulations
• Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
• A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems
• Solving integer programs with a few important binary gub constraints
• Solving linear programming problems exactly
• A hybrid approach to resolving a differentiable integer program.
• The multidimensional 0-1 knapsack problem: an overview.
• Representability of functions
• Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
• Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities
• A note on modeling multiple choice requirements for simple mixed integer programming solvers
• Mixed integer models for the stationary case of gas network optimization
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Production flow prototyping subject to imprecise activity specification
• The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
• Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
• Multivariable Branching: A 0-1 Knapsack Problem Case Study
• Branch and bound, integer, and non-integer programming
• A branch-and-price approach for the maximum weight independent set problem
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
• Learning to branch: generalization guarantees and limits of data-independent discretization
• A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
• SCIP: solving constraint integer programs
• Implementations of special ordered sets in MP software
• Branch and bound with estimation based on pseudo-shadow-prices
• Integer-programming software systems
• Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information
• Global solution of optimization problems with signomial parts

This page was built for publication: Branch and Bound Methods for Mathematical Programming Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4191855)