Add to ORKGThe purpose of this note is to report a new tool for discrete programming: Bound improving sequences. It consists on the construction of a sequence of bounds that, under appropriate conditions, converges in a finite number of steps to the optimal value of the objective function of the Problem studied. As a byproduct an optimal solution for that problem is produced. For the case of 0-1 LP's such a sequence can be efficiently computed. Examples, geometric interpretations and computational experience reports for this case are given.N/
We consider a new approach to enumeration of near-to-optimal solutions in discrete optimization prob...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
AbstractThis paper investigates a technique of building up discrete relaxations of combinatorial opt...
The purpose of this note is to report a new tool for discrete programming: Bound improving sequences...
In this paper we present a generalization and a computational improvement of the Bound Improvement S...
This paper is primarily concerned with the extension of the bound improving sequence algorithm (Bárc...
AbstractThis paper gives a general theory for constructive dual methods in discrete programming. The...
This dissertation analyzes and computationally tests a novel approach to improving the performance o...
summary:The paper is a contribution to the general theory of problems of discrete programming. Parti...
The paper describes an optimization procedure for a class of discrete optimization problems which is...
We present an improved algorithm for finding exact solutions to Max-Cut and the related binary quadr...
Discrete mathematics brings interesting problems to teach and learn proof with accessible objects su...
We propose a general branch-and-bound algorithm for discrete optimization in which binary decision d...
Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete optimizati...
We know that the effectiveness of the branch-and-bound algorithms proposed for the solution of combi...
We consider a new approach to enumeration of near-to-optimal solutions in discrete optimization prob...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
AbstractThis paper investigates a technique of building up discrete relaxations of combinatorial opt...
The purpose of this note is to report a new tool for discrete programming: Bound improving sequences...
In this paper we present a generalization and a computational improvement of the Bound Improvement S...
This paper is primarily concerned with the extension of the bound improving sequence algorithm (Bárc...
AbstractThis paper gives a general theory for constructive dual methods in discrete programming. The...
This dissertation analyzes and computationally tests a novel approach to improving the performance o...
summary:The paper is a contribution to the general theory of problems of discrete programming. Parti...
The paper describes an optimization procedure for a class of discrete optimization problems which is...
We present an improved algorithm for finding exact solutions to Max-Cut and the related binary quadr...
Discrete mathematics brings interesting problems to teach and learn proof with accessible objects su...
We propose a general branch-and-bound algorithm for discrete optimization in which binary decision d...
Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete optimizati...
We know that the effectiveness of the branch-and-bound algorithms proposed for the solution of combi...
We consider a new approach to enumeration of near-to-optimal solutions in discrete optimization prob...
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x ...
AbstractThis paper investigates a technique of building up discrete relaxations of combinatorial opt...