The following pages link to Adjacency on polymatroids (Q3335528):
Displaying 18 items.
- Adjacency polynomials of digraph transformations (Q277610) (← links)
- A note on Frank's generalized polymatroids (Q790124) (← links)
- Ehrhart polynomials of matroid polytopes and polymatroids (Q1042445) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
- Paths on polymatroids (Q1196722) (← links)
- The polytope of win vectors (Q1293440) (← links)
- Adjacency of the best and second best valued solutions in combinatorial optimization problems (Q1314336) (← links)
- An extreme point theorem for ordered polymatroids on chain orders (Q1380702) (← links)
- Adjacency on the order polytope with applications to the theory of fuzzy measures (Q2270242) (← links)
- Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
- Circuit walks in integral polyhedra (Q2673232) (← links)
- The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
- (Q3684132) (← links)
- The Partial Order of a Polymatroid Extreme Point (Q3696865) (← links)
- On the Length of Monotone Paths in Polyhedra (Q5009332) (← links)
- On the expansion of combinatorial polytopes (Q5096818) (← links)
- A normal fan projection algorithm for low-rank optimization (Q6665394) (← links)
