The following pages link to (Q5620998):
Displayed 47 items.
- On certain convex matrix sets (Q581622) (← links)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- A generalization of Robacker's theorem (Q1118612) (← links)
- Polyhedra related to undirected multicommodity flows (Q1119951) (← links)
- Polyhedra of regular p-nary group problems (Q1121172) (← links)
- On ternary problems (Q1121787) (← links)
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé (Q1144589) (← links)
- Representing matrices (Q1146676) (← links)
- Matroids and multicommodity flows (Q1161527) (← links)
- Correction to 'A constructive decomposition and Fulkerson's characterization of permutation matrices' (Q1220117) (← links)
- A proof of Fulkerson's characterization of permutation matrices (Q1221117) (← links)
- Blocking pairs of polyhedra arising from network flows (Q1221561) (← links)
- Some combinatorial properties of centrosymmetric matrices (Q1234335) (← links)
- Chords and disjoint paths in matroids (Q1241753) (← links)
- An unbounded matroid intersection polyhedron (Q1244236) (← links)
- The matroids with the max-flow min-cut property (Q1245970) (← links)
- A two-commodity cut theorem (Q1250228) (← links)
- Blocking, antiblocking, and pairs of matroids and polymatroids (Q1255012) (← links)
- Analytic proofs of a network feasibility theorem and a theorem of Fulkerson (Q1255545) (← links)
- On removing a vertex from the assignment polytope (Q1260145) (← links)
- An analytic symmetrization of max flow-min cut (Q1356775) (← links)
- Minimum weight \((T,d)\)-joins and multi-joins (Q1381848) (← links)
- Packing boxes with harmonic bricks (Q1393253) (← links)
- The disjunctive procedure and blocker duality (Q1613383) (← links)
- Four problems on graphs with excluded minors (Q1823871) (← links)
- Compositions for matroids with the Fulkerson property (Q1900139) (← links)
- A constructive decomposition and Fulkerson's characterization of permutation matrices (Q2265487) (← links)
- Clutter nonidealness (Q2492208) (← links)
- On a certain class of nonideal clutters (Q2500534) (← links)
- Anti-blocking polyhedra (Q2549326) (← links)
- The equipartition polytope. I: Formulations, dimension and basic facets (Q2639779) (← links)
- The nonidealness index of circulant matrices (Q3503550) (← links)
- Integer Rounding for Polymatroid and Branching Optimization Problems (Q3668310) (← links)
- Binary group and Chinese postman polyhedra (Q3717740) (← links)
- Dual row modules and polyhedra of blocking group problems (Q3777799) (← links)
- Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks (Q3795495) (← links)
- Characterization of facets for multiple right-hand choice linear programs (Q3896844) (← links)
- On the use of penumbras in blocking and antiblocking theory (Q3931051) (← links)
- Polyhedral polarity defined by a general bilinear inequality (Q3937166) (← links)
- Transversal matroid intersections and related packings (Q4126086) (← links)
- On Four Problems in Graph Theory (Q4722099) (← links)
- Dominants and submissives of matching polyhedra (Q4726052) (← links)
- Packing rooted directed cuts in a weighted directed graph (Q4769069) (← links)
- Blocking and anti-blocking pairs of polyhedra (Q5668263) (← links)
- Energy of convex sets, shortest paths, and resistance (Q5937247) (← links)