The following pages link to (Q3673577):
Displaying 50 items.
- Distributed averaging with linear objective maps (Q290860) (← links)
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- On integer programming with bounded determinants (Q315478) (← links)
- The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties (Q322558) (← links)
- On the diameter of partition polytopes and vertex-disjoint cycle cover (Q378108) (← links)
- Exact and asymptotic results on coarse Ricci curvature of graphs (Q468431) (← links)
- Lower bounds for the number of hyperplanes separating two finite sets of points (Q492284) (← links)
- Sparse interpolation of symmetric polynomials (Q678607) (← links)
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope (Q735404) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Permutation polytopes and indecomposable elements in permutation groups (Q855825) (← links)
- Transportation matrices with staircase patterns and majorization (Q947648) (← links)
- Column generation in the integral simplex method (Q948677) (← links)
- \(N\)-fold integer programming (Q951095) (← links)
- Majorization permutahedra and (0,1)-matrices (Q968997) (← links)
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes (Q984027) (← links)
- The \(k\)-assignment polytope (Q1015319) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
- Graphs of transportation polytopes (Q1040845) (← links)
- Conditions for the existence of solutions of the three-dimensional planar transportation problem (Q1081532) (← links)
- Determining a matroid polytope by non-Radon partitions (Q1090334) (← links)
- On the extremal points of a class of polytopes of matrices (Q1183198) (← links)
- Row-stochastic matrices with a common left fixed vector (Q1187389) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- A characterization of the uncapacitated network design polytope (Q1200785) (← links)
- Convex hulls of orbits of representations of finite groups and combinatorial optimization (Q1263669) (← links)
- The geometry of products of minors (Q1275663) (← links)
- Matrix majorization (Q1300866) (← links)
- Simple vertices of maximal minor polytopes (Q1327453) (← links)
- Multidimensional medians arising from geodesics on graphs (Q1359409) (← links)
- On the number of faces of certain transportation polytopes (Q1580679) (← links)
- Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters (Q1582079) (← links)
- The hierarchy of circuit diameters and transportation polytopes (Q1707908) (← links)
- The diameters of network-flow polytopes satisfy the Hirsch conjecture (Q1785200) (← links)
- Majorization-constrained doubly stochastic matrices (Q1863545) (← links)
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron (Q1877595) (← links)
- Continuous control of chaos (Q1910602) (← links)
- Cyclic polytopes and oriented matroids (Q1964648) (← links)
- On the circuit diameter conjecture (Q1991340) (← links)
- A two-step method for solving vector optimization problems on permutation configuration (Q2044039) (← links)
- A note on the approximability of deepest-descent circuit steps (Q2060534) (← links)
- Hardness results for multimarginal optimal transport problems (Q2067496) (← links)
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
- Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and sudoku boards (Q2402454) (← links)
- Fractional perfect \(b\)-matching polytopes. I: General theory (Q2435578) (← links)
- On the vertices of the \(d\)-dimensional Birkhoff polytope (Q2441581) (← links)
- Polyhedral combinatorics of multi-index axial transportation problems (Q2482774) (← links)
- Permutohedra and minimal matrices (Q2576235) (← links)
- Lower bounds for contingency tables via Lorentzian polynomials (Q2698417) (← links)
