Search Results - programming: integer algorithm branch and bound

The Lagrangian Relaxation Method for Solving Integer Programming Problems by 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…”
Get full text

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

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

Laying Out Sparse Graphs with Provably Minimum Bandwidth by Caprara, Alberto, Salazar-Gonzalez, Juan-Jose

“… In this paper, we illustrate a new simple lower bound on the optimal bandwidth and its extension within an enumerative algorithm, leading to integer linear-programming relaxations that can be…”
Get full text

Multi-baseline phase unwrapping with robust branch and bound pure integer programming algorithm by 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…”
Get full text

The Lagrangian Relaxation Method for Solving Integer Programming Problems by 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…”
Get full text

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

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

A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem by Patterson, James H

“…A recurring problem in managing project activity involves the allocation of scarce resources to the individual activities comprising the project Resource…”
Get full text

Parallel branch and bound algorithm for solving integer linear programming models derived from behavioral synthesis by 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…”
Get full text

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs by 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…”
Get full text

A Novel Branch and Bound Pure Integer Programming Phase Unwrapping Algorithm for Dual-Baseline InSAR by 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…”
Get full text

An effective branch-and-bound algorithm for convex quadratic integer programming by 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…”
Get full text

Feasible Path-Based Branch and Bound Algorithm for Highly Nonconvex Mixed-Integer Nonlinear Programming Problems by 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…”
Get full text

A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness by 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…”
Get full text

An Exact Algorithm for the Two-Constraint 0-1 Knapsack Problem by 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…”
Get full text

Integer Linear Programming Model for Profit Maximization using Branch and Bound Algorithm in Retail Companies: Case of a Peruvian Company by 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…”
Get full text

The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability by 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…”
Get full text

A Note on Branch and Bound Algorithm for Integer Linear Programming by Inayatullah, Syed, Riaz, Wajiha, Jafree, Hafsa Athar, Siddiqi, Tanveer Ahmed, Imtiaz, Muhammad, Naz, Saba, Hassan, Syed Ahmad

“…In branch and bound algorithm for integer linear programming the usual approach is incorporating dual simplex method to achieve feasibility for each sub-problem…”
Get full text

A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems by Sun, Minghe

“… Because such efficient solutions are usually not integer solutions, a branch‐and‐bound (BB) algorithm is developed to find integer efficient solutions…”
Get full text

A Branch and Bound Algorithm for Transmission Network Expansion Planning Using Nonconvex Mixed-Integer Nonlinear Programming Models by Zoppei, Reinaldo T., Delgado, Marcos A. J., Macedo, Leonardo H., Rider, Marcos J., Romero, Ruben

“…The branch and bound (BB) algorithm is widely used to obtain the global solution of mixed-integer linear programming (MILP) problems…”
Get full text

Branch and Bound Experiments in Convex Nonlinear Integer Programming by 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…”
Get full text