The following pages link to (Q5675543):
Displaying 50 items.
- Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
- On flows in simple bidirected and skew-symmetric networks (Q415697) (← links)
- An oriented hypergraphic approach to algebraic graph theory (Q448376) (← links)
- On the transportation problem with market choice (Q479018) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Exact solution approaches for the multi-period degree constrained minimum spanning tree problem (Q724056) (← links)
- Oriented gain graphs, line graphs and eigenvalues (Q739113) (← links)
- Signed analogue of general Kotzig-Lovász decomposition (Q777362) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- On the relationship between ATSP and the cycle cover problem (Q868952) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
- Complete partitions of graphs (Q949754) (← links)
- Approximation algorithm for maximum edge coloring (Q1007243) (← links)
- Minimum mean cycle problem in bidirected and skew-symmetric graphs (Q1013299) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- On the cycle polytope of a binary matroid (Q1078187) (← links)
- Linear and combinatorial sharing problems (Q1081535) (← links)
- General factors of graphs (Q1085185) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- Total unimodularity and the Euler-subgraph problem (Q1107442) (← links)
- An extension of the König-Egerváry property to node-weighted bidirected graphs (Q1108202) (← links)
- A polynomial algorithm for b-matchings: An alternative approach (Q1109690) (← links)
- On the diameter of the edge cover polytope (Q1115884) (← links)
- Forest covers and a polyhedral intersection theorem (Q1121807) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- On generalized matching problems (Q1149783) (← links)
- Another look at the degree constrained subgraph problem (Q1167739) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- \(b\)-matching degree-sequence polyhedra (Q1180424) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- On shortest \(T\)-joins and packing \(T\)-cuts (Q1210583) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- A separation algorithm for the matchable set polytope (Q1334957) (← links)
- A branch-and-cut algorithm for the equicut problem (Q1373750) (← links)
- Rational and integral \(k\)-regular matrices. (Q1420582) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients (Q1669013) (← links)
- Metabolic networks are NP-hard to reconstruct (Q1797721) (← links)
- An identity for matching and skew-symmetric determinant (Q1805187) (← links)
