AbstractA method is described for obtaining the facets of certain convex polyhedra from the optimal solutions to a related linear programming problem. This approach provides a direct proof, via the duality principle, for a result of D.R. Fulkerson, and leads to a class of readily constructible examples of the so-called “blocking pairs” of polyhedra introduced by Fulkerson in [6]
AbstractIn this paper, we show that a problem of finding a permuted version of k vectors from RN suc...
Combinatorial optimization problems appear in many disciplines ranging from management and logistics...
Combinatorial optimization problems appear in many disciplines ranging from management and logistic...
AbstractNecessary and sufficient conditions are given for a doubly stochastic matrix D to be express...
AbstractWe consider the set of n×n matrices X=(xij) for which ∑iϵI∑jϵJxij ⩾ |I|+|J|−n, for all I,J⊆ ...
AbstractWe apply a recent characterization of optimality for the abstract convex program with a cone...
AbstractThe notion of an almost integral polyhedron is introduced and used to obtain a new proof of ...
AbstractWe provide an elementary proff of Fulkerson's theorem which gives the permutation matrices a...
AbstractLet P be the polyhedron given by P={xϵRn:Nx=0, a⩽x⩽b} , where N is a totally unimodular matr...
Lovasz and Schrijver (1991) described a semidcfinile operator for generating strong valid inequaliti...
This paper deals with linear systems containing finitely many weak and/or strict inequalities, whose...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
AbstractWe consider the convex hull of the even permutations on a set of n elements. We define a cla...
This chapter discusses polyhedral approaches in combinatorial optimization. Using a cutting-plane al...
AbstractThe elements in the group of centrosymmetric n×n permutation matrices are the extreme points...
AbstractIn this paper, we show that a problem of finding a permuted version of k vectors from RN suc...
Combinatorial optimization problems appear in many disciplines ranging from management and logistics...
Combinatorial optimization problems appear in many disciplines ranging from management and logistic...
AbstractNecessary and sufficient conditions are given for a doubly stochastic matrix D to be express...
AbstractWe consider the set of n×n matrices X=(xij) for which ∑iϵI∑jϵJxij ⩾ |I|+|J|−n, for all I,J⊆ ...
AbstractWe apply a recent characterization of optimality for the abstract convex program with a cone...
AbstractThe notion of an almost integral polyhedron is introduced and used to obtain a new proof of ...
AbstractWe provide an elementary proff of Fulkerson's theorem which gives the permutation matrices a...
AbstractLet P be the polyhedron given by P={xϵRn:Nx=0, a⩽x⩽b} , where N is a totally unimodular matr...
Lovasz and Schrijver (1991) described a semidcfinile operator for generating strong valid inequaliti...
This paper deals with linear systems containing finitely many weak and/or strict inequalities, whose...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
AbstractWe consider the convex hull of the even permutations on a set of n elements. We define a cla...
This chapter discusses polyhedral approaches in combinatorial optimization. Using a cutting-plane al...
AbstractThe elements in the group of centrosymmetric n×n permutation matrices are the extreme points...
AbstractIn this paper, we show that a problem of finding a permuted version of k vectors from RN suc...
Combinatorial optimization problems appear in many disciplines ranging from management and logistics...
Combinatorial optimization problems appear in many disciplines ranging from management and logistic...
DOI
Add to ORKG