In this paper, we propose a framework for obtaining the optimal solution of an elevator operation problem by applying branch-and-bound method, where it is assumed that all information about the ...

We present a new MIP model, propose a novel heuristic algorithm based on beam search, as well as a task-oriented branch-and-bound procedure which uses new reduction rules and lower bounds for solving ...

ABSTRACT In this paper, we present a branch and bound-based technique for generating the nondominated set for the multi-objective assignment problem. The approach utilizes the Hungarian algorithm to ...

An efficient branch-and-bound algorithm for computing the best-subset regression models is proposed. The algorithm avoids the computation of the whole regression tree that generates all possible ...

In this paper we develop a new conditional penalty for the fixed charge transportation problem. This penalty is stronger than both the Driebeek penalties and the Lagrangean penalties of Cabot and ...

In this paper, a feasible path-based branch and bound (B&B) algorithm is proposed to solve mixed-integer nonlinear programming problems with highly nonconvex nature through integration of the ...

The molecular-oriented RMSD with branch-and-bound (mobbRMSD) is an RMSD-based metric for 3D chemical structure similarity. mobbRMSD is formulated in molecular-oriented coordinates and uses the ...