Branch-and-Bound Methods: General Formulation and Properties
From MaRDI portal
Publication:5632358
DOI10.1287/opre.18.1.24zbMath0225.90030OpenAlexW2103054960MaRDI QIDQ5632358
Publication date: 1970
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.18.1.24
Related Items
A discrete meta-control procedure for approximating solutions to binary programs, An interval branch and bound algorithm for global optimization of a multiperiod pricing model, Solving the median problem with continuous demand on a network, DASH: dynamic approach for switching heuristics, Branch-and-bound algorithm for a competitive facility location problem, A simulation tool for the performance evaluation of parallel branch and bound algorithms, Optimal dispatching strategy on an airline network after a schedule perturbation, A binary integer linear program with multi-criteria and multi-constraint levels, Maximum-likelihood detection based on branch and bound algorithm for MIMO systems, Exact and approximate solutions to the multisource weber problem, Dominance rules in combinatorial optimization problems, A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps, Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates, Heuristics and their design: A survey, Algorithms for parametric nonconvex programming, An effective structured approach to finding optimal partitions of networks, Pareto optimality and robustness in bi-blending problems, Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints, The semi-continuous quadratic mixture design problem: description and branch-and-bound approach, Branch-and-bound as a higher-order function, Unnamed Item, A branch and bound algorithm for the maximum clique problem, Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming, Discrete solutions to engineering design problems, Optimization issues in predictive control with fuzzy objective functions, Optimization problems in multivariable fuzzy predictive control, Using branch-and-bound algorithms to obtain suboptimal solutions, Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in faming system design, P2P B&B and GA for the Flow-Shop Scheduling Problem, An approach for solving a class of transportation scheduling problems, Core group placement: allocation and provisioning of heterogeneous resources, Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Theoretical comparisons of search strategies in branch-and-bound algorithms, Depth-m search in branch-and-bound algorithms, Multi-commodity supply network planning in the forest supply chain, On a branch-and-bound approach for a Huff-like Stackelberg location problem, A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures, General branch and bound, and its relation to \(A^*\) and \(AO^*\), Recursive branch and bound
