Keyword: programming: branch and bound

Found 862 papers in total
Packing of one‐dimensional bins with contiguous selection of identical items: An exact method of optimal solution
Packing of one‐dimensional bins with contiguous selection of identical items: An exact method of optimal solution
2011,
Consideration was given to the one‐dimensional bin packing problem under the...
Large neighbourhood search algorithms for the founder sequence reconstruction problem
Large neighbourhood search algorithms for the founder sequence reconstruction problem
2012,
The reconstruction of founder genetic sequences of a population is a relevant issue in...
A discrete model for optimal operation of fossil‐fuel generators of electricity
A discrete model for optimal operation of fossil‐fuel generators of electricity
2012,
This paper presents a new discrete approach to the price‐based dynamic economic...
A branch‐and‐price approach for harvest scheduling subject to maximum area restrictions
A branch‐and‐price approach for harvest scheduling subject to maximum area restrictions
2012,
Recently, research on exact methods has been undertaken to solve forest management...
Improving an exact approach for solving separable integer quadratic knapsack problems
Improving an exact approach for solving separable integer quadratic knapsack problems
2012,
We consider the specially structured (pure) integer Quadratic Multi‐Knapsack...
Optimum process plan selection via branch‐and‐bound algorithm in an automated manufacturing environment
Optimum process plan selection via branch‐and‐bound algorithm in an automated manufacturing environment
2012,
Due to the accessibility of alternative machines, tools, fixtures and other auxiliary...
New dominance rules and exploration strategies for the 1|ri|ΣUi scheduling problem
New dominance rules and exploration strategies for the 1|ri|ΣUi scheduling problem
2012,
The paper proposes a new exact approach, based on a Branch, Bound, and Remember...
General forms of the quadratic assignment problem
General forms of the quadratic assignment problem
2012,
In this paper, a general model has been formulated for facility location. The proposed...
Dynamic Hierarchical Packing of Wireless Switches Using a Seed, Repair and Replace Genetic Algorithm
Dynamic Hierarchical Packing of Wireless Switches Using a Seed, Repair and Replace Genetic Algorithm
1997,
Suppose that items of equipment are to be added to a supply station (e.g., new switch...
General Further Discarding Tests in Geometric Branch-and-Bound Methods for Non-Convex Multicriteria Optimization Problems
General Further Discarding Tests in Geometric Branch-and-Bound Methods for Non-Convex Multicriteria Optimization Problems
2011,
Using a geometric branch-and-bound technique, my goal in this paper is to compute a...
Combined bound‐grid‐factor constraints for enhancing RLT relaxations for polynomial programs
Combined bound‐grid‐factor constraints for enhancing RLT relaxations for polynomial programs
2011,
This paper studies the global optimization of polynomial programming problems using...
The maximum capture per unit cost location problem
The maximum capture per unit cost location problem
2011,
This paper considers the problem of siting p new facilities of an entering firm to a...
A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
2011,
Branch and Bound Algorithms based on Interval Arithmetic permit to solve exactly...
An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable
An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable
2011,
The 0–1 linear knapsack problem with a single continuous variable ( KPC ) is an...
A heterogeneous cooperative parallel search of branch‐and‐bound method and tabu search algorithm
A heterogeneous cooperative parallel search of branch‐and‐bound method and tabu search algorithm
2011,
In this study, we present a heterogeneous cooperative parallel search that integrates...
A branching scheme for minimum cost tournaments with regard to real‐world constraints
A branching scheme for minimum cost tournaments with regard to real‐world constraints
2011,
Single round robin tournaments are a well‐known class of sports leagues...
Evaluating a branch‐and‐bound RLT‐based algorithm for minimum sum‐of‐squares clustering
Evaluating a branch‐and‐bound RLT‐based algorithm for minimum sum‐of‐squares clustering
2011,
Minimum sum-of-squares clustering consists in partitioning a given set of n points...
Using the idea of expanded core for the exact solution of bi‐objective multi‐dimensional knapsack problems
Using the idea of expanded core for the exact solution of bi‐objective multi‐dimensional knapsack problems
2011,
We propose a methodology for obtaining the exact Pareto set of Bi‐Objective...
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices
2011,
We present branching‐on‐hyperplane methods for solving mixed integer...
Combinatorial integral approximation
Combinatorial integral approximation
2011,
We are interested in structures and efficient methods for mixed‐integer...
An exact algorithm for side‐chain placement in protein design
An exact algorithm for side‐chain placement in protein design
2011,
Computational protein design aims at constructing novel or improved functions on the...
Solving Large p‐Median Problems with a Radius Formulation
Solving Large p‐Median Problems with a Radius Formulation
2011,
By means of a model based on a set covering formulation, it is shown how the p...
A discrete competitive facility location model with variable attractiveness
A discrete competitive facility location model with variable attractiveness
2011,
We consider the discrete version of the competitive facility location problem in which...
An efficient computational method for a stochastic dynamic lot‐sizing problem under service‐level constraints
An efficient computational method for a stochastic dynamic lot‐sizing problem under service‐level constraints
2011,
We provide an efficient computational approach to solve the mixed integer programming...
Papers per page: