We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m×n transportation problem is at most 8(m+n−2
We consider convex polyhedra with applications to well-known combinatorial optimization problems: th...
The combinatorial diameter of a polytope P is the maximum value of a shortest path between two verti...
In 1957 W.M. Hirsch conjectured that every d-polytope with n facets has edge-diameter at most n \Gam...
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of an...
Abstract. Brightwell, van den Heuvel and Stougie proved that the diameter of an m × n transportation...
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear p...
This paper discusses properties of the graphs of 2-way and 3-way transportation polytopes, ...
AbstractThis paper discusses properties of the graphs of 2-way and 3-way transportation polytopes, i...
This dissertation investigates the geometric combinatorics of convex polytopes and connecti...
A transportation polytope consists of all multidimensional arrays or tables of non-negative real num...
Abstract: "In this paper, some results on the complexity of computing the combinatorial diameter of ...
The diameter of a set P of n points in RdRd is the maximum Euclidean distance between any two points...
International audienceThe diameter of a set P of n points in ℝd is the maximum Euclidean distance be...
Let ∆(d, n) be the maximum possible edge diameter over all d-dimensional polytopes defined by n ineq...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
We consider convex polyhedra with applications to well-known combinatorial optimization problems: th...
The combinatorial diameter of a polytope P is the maximum value of a shortest path between two verti...
In 1957 W.M. Hirsch conjectured that every d-polytope with n facets has edge-diameter at most n \Gam...
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of an...
Abstract. Brightwell, van den Heuvel and Stougie proved that the diameter of an m × n transportation...
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear p...
This paper discusses properties of the graphs of 2-way and 3-way transportation polytopes, ...
AbstractThis paper discusses properties of the graphs of 2-way and 3-way transportation polytopes, i...
This dissertation investigates the geometric combinatorics of convex polytopes and connecti...
A transportation polytope consists of all multidimensional arrays or tables of non-negative real num...
Abstract: "In this paper, some results on the complexity of computing the combinatorial diameter of ...
The diameter of a set P of n points in RdRd is the maximum Euclidean distance between any two points...
International audienceThe diameter of a set P of n points in ℝd is the maximum Euclidean distance be...
Let ∆(d, n) be the maximum possible edge diameter over all d-dimensional polytopes defined by n ineq...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
We consider convex polyhedra with applications to well-known combinatorial optimization problems: th...
The combinatorial diameter of a polytope P is the maximum value of a shortest path between two verti...
In 1957 W.M. Hirsch conjectured that every d-polytope with n facets has edge-diameter at most n \Gam...
DOI
Add to ORKG