Suchergebnisse - Programming: Integer: Algorithms: Branch and Bound

The Lagrangian Relaxation Method for Solving Integer Programming Problems von Fisher, Marshall L

“… (for minimization problems) on the optimal value of the original problem. The Lagrangian problem can thus be used in place of a linear programming relaxation to provide bounds in a branch and bound algorithm …”
Volltext

A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness von Wu, S David, Eui-Seok Byeon, Storer, Robert H

“… The weighted tardiness job-shop scheduling problem is studied, with the presence of random shop disturbances being taken into consideration. A basic thesis of …”
Volltext

An Exact Algorithm for the Two-Constraint 0-1 Knapsack Problem von Martello, Silvano, Toth, Paolo

“… These results are used to obtain an exact branch-and-bound algorithm, which also includes heuristic procedures and a reduction technique …”
Volltext

Improving the efficiency of the Branch and Bound algorithm for integer programming based on “flatness” information von Derpich, Iván, Vera, Jorge R.

“… This paper describes a strategy for defining priorities for the branching variables in a Branch and Bound algorithm …”
Volltext

Branch and Bound Experiments in Convex Nonlinear Integer Programming von Gupta, Omprakash K, Ravindran, A

“… The branch and bound principle has long been established as an effective computational tool for solving mixed integer linear programming problems …”
Volltext

Multi-baseline phase unwrapping with robust branch and bound pure integer programming algorithm von Liu, Hui, Yue, JiaWei, Liu, WenKai, Huang, QiHuan, Li, GeShuang, Liu, Min

“… •A new robust branch and bound pure integer programming phase unwrapping (BB-PIP-PU) algorithm for multi-baseline InSAR based on operations research is proposed …”
Volltext

An enhanced branch-and-bound algorithm for bilevel integer linear programming von Liu, Shaonan, Wang, Mingzheng, Kong, Nan, Hu, Xiangpei

“… •An enhanced branch-and-bound algorithm for a class of bilevel integer linear programming (BILP) problems …”
Volltext

Minimizing the Average Query Complexity of Learning Monotone Boolean Functions von Torvik, Vetle I, Triantaphyllou, Evangelos

“… A frameworkfor unbiased average case comparison of monotone Boolean function inference algorithms is developed using unequal probability sampling …”
Volltext

A Dual-Based Procedure for Dynamic Facility Location von Van Roy, Tony J, Erlenkotter, Donald

“… The formulation permits both the opening of new facilities and the closing of existing ones. A branch-and-bound procedure incorporating a dual ascent method is presented and shown, in computational tests, to be superior to previously developed methods …”
Volltext

Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants von Tang, Christopher S, Denardo, Eric V

“… We show that this scheduling problem generalizes the classical bin packing problem, and we present a non-LP-based branch-and-bound procedure that terminates with an optimal solution …”
Volltext

Minimizing Mean Squared Deviation of Completion Times About a Common Due Date von Bagchi, Uttarayan, Sullivan, Robert S, Chang, Yih-Long

“… This paper addresses a nonpreemptive single machine scheduling problem where all jobs have a common due date and have zero ready time. The scheduling objective …”
Volltext

Parallel branch and bound algorithm for solving integer linear programming models derived from behavioral synthesis von Fallah, Mohammad K, Fazlali, Mahmood

“… In this paper, we address this challenge by developing two exact parallel branch and bound algorithms which are capable of solving large-scale ILP models derived from behavioral synthesis …”
Volltext

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs von Vielma, Juan Pablo, Ahmed, Shabbir, Nemhauser, George L

“… This paper develops a linear-programming-based branch-and-bound algorithm for mixed-integer conic quadratic programs …”
Volltext

Heuristics for Multilevel Lot-Sizing with a Bottleneck von Billington, Peter J, McClain, John O, Thomas, L. Joseph

“… A series of Lagrangian relaxations (one for each item in the product structure) is imbedded in a branch and bound procedure …”
Volltext

The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability von Jäger, Gerold, Climer, Sharlee, Zhang, Weixiong

“… We explicitly exploit these features in three computational approaches that are based on integer linear programming, depth-first branch-and-bound, and Boolean satisfiability …”
Volltext

A Novel Branch and Bound Pure Integer Programming Phase Unwrapping Algorithm for Dual-Baseline InSAR von Liu, Hui, Yue, JiaWei, Huang, QiHuan, Li, GeShuang, Liu, Min

“… ) problem in science of overall planning, a new branch and bound PIP-PU algorithm for dual-baseline InSAR is proposed …”
Volltext

An effective branch-and-bound algorithm for convex quadratic integer programming von Buchheim, Christoph, Caprara, Alberto, Lodi, Andrea

“… We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints …”
Volltext

Feasible Path-Based Branch and Bound Algorithm for Highly Nonconvex Mixed-Integer Nonlinear Programming Problems von Chao Liu, Yingjie Ma, Dongda Zhang, Jie Li

“… In this paper, a feasible path-based branch and bound (B&B) algorithm is presented for solving mixed-integer nonlinear programming problems with highly nonconvex nature …”
Volltext

Assembly Line Balancing with Processing Alternatives: An Application von Pinto, Peter A, Dannenbring, David G, Khumawala, Basheer M

“… The conventional approach to the assembly line balancing problem assumes that the manufacturing methods to be used have been predetermined. However, in …”
Volltext

Integer Linear Programming Model for Profit Maximization using Branch and Bound Algorithm in Retail Companies: Case of a Peruvian Company von Chancahuana Castillo, John Diego, Parisuaña Yucra, Willy Noe, Soto, Mario Ninaquispe, Ynfantes, Sonia Castro

“… ) using linear programming techniques and the Branch and Bound algorithm. To introduce this paper we refute, through a review of previous studies in the same field, the use of this approach for its effectiveness in business decision-making …”
Volltext