This article provides a method of constructing branches for solving an integer problem of linear programming by the branch-and-bound method in the case when the solution of the relaxed problem contains a large number of fractional unknown values
In this paper we describe a new branch and bound algorithm for solving 0-1 integer linear programs (...
Copyright © 2009, by the author(s). Please do not quote, cite, or reproduce without permission from ...
In this work, we propose a strategy for computing valid lower bounds for a specific class of integer...
The branch and bound principle has been established as an effective computational tool for solving l...
The branch and bound principle has long been established as an effective computational tool for solv...
In our talk we present an algorithm for determining initial bound for the Branch and Bound (B&B) met...
Mixed integer programs are commonly solved with linear programming based branch-and-bound algorithms...
In this paper we contemplate the Binary integer programming problems and presents a summary of the t...
Within the context of solving Mixed-Integer Linear Programs by a Branch-and- Cut algorithm, we propo...
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algor...
Branching in mixed-integer (or integer) linear programming requires choosing both the branching vari...
A number of discrete variable representations are well accepted and find regular use within LP syste...
An algorithm is proposed to find an integer solution for bilevel linear fractional programming probl...
In this paper, a new branch-and-cut algorithm for mixed integer bi-level programming is proposed. Fo...
An effective branch and bound algorithm is proposed for globally solving minimax linear fractional p...
In this paper we describe a new branch and bound algorithm for solving 0-1 integer linear programs (...
Copyright © 2009, by the author(s). Please do not quote, cite, or reproduce without permission from ...
In this work, we propose a strategy for computing valid lower bounds for a specific class of integer...
The branch and bound principle has been established as an effective computational tool for solving l...
The branch and bound principle has long been established as an effective computational tool for solv...
In our talk we present an algorithm for determining initial bound for the Branch and Bound (B&B) met...
Mixed integer programs are commonly solved with linear programming based branch-and-bound algorithms...
In this paper we contemplate the Binary integer programming problems and presents a summary of the t...
Within the context of solving Mixed-Integer Linear Programs by a Branch-and- Cut algorithm, we propo...
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algor...
Branching in mixed-integer (or integer) linear programming requires choosing both the branching vari...
A number of discrete variable representations are well accepted and find regular use within LP syste...
An algorithm is proposed to find an integer solution for bilevel linear fractional programming probl...
In this paper, a new branch-and-cut algorithm for mixed integer bi-level programming is proposed. Fo...
An effective branch and bound algorithm is proposed for globally solving minimax linear fractional p...
In this paper we describe a new branch and bound algorithm for solving 0-1 integer linear programs (...
Copyright © 2009, by the author(s). Please do not quote, cite, or reproduce without permission from ...
In this work, we propose a strategy for computing valid lower bounds for a specific class of integer...
DOI
Add to ORKG