The following pages link to (Q3274170):
Displaying 50 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- Rao's degree sequence conjecture (Q401494) (← links)
- Flows and parity subgraphs of graphs with large odd-edge-connectivity (Q444374) (← links)
- What the transportation problem did for me (Q537598) (← links)
- Circular flow on signed graphs (Q651035) (← links)
- An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem (Q651729) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Integral infeasibility and testing total dual integrality (Q757248) (← links)
- Financial systems: A few theoretical and algebraic considerations for their modeling (Q794549) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- The travelling preacher, projection, and a lower bound for the stability number of a graph (Q951102) (← links)
- A new algorithm for solving the feasibility problem of a network flow (Q990544) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- A system of linear equations related to the transportation problem with application to probability theory (Q1104859) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions (Q1120635) (← links)
- Total unimodularity and combinatorial theorems (Q1144100) (← links)
- Matroids and multicommodity flows (Q1161527) (← links)
- Optimal cocircuits in regular matroids and applications (Q1164550) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- Approximate binary search algorithms for mean cuts and cycles (Q1319679) (← links)
- The facets of the polyhedral set determined by the Gale-Hoffman inequalities (Q1321672) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- On \(k\)-strong and \(k\)-cyclic digraphs (Q1356647) (← links)
- How to compute least infeasible flows (Q1373747) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Flows, view obstructions, and the lonely runner (Q1386416) (← links)
- Packing spanning trees in highly essentially connected graphs (Q1618210) (← links)
- A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
- A polynomial time algorithm for the minimum flow problem in time-varying networks (Q1730612) (← links)
- The flow index and strongly connected orientations (Q1746575) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- An analogue of Hoffman's circulation conditions for max-balanced flows (Q1802959) (← links)
- Polynomials associated with nowhere-zero flows (Q1850590) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach (Q2012539) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- Metric and ultrametric inequalities for directed graphs (Q2127613) (← links)
- Comparison of formulations for the inventory routing problem (Q2160484) (← links)
- Circular zero-sum \(r\)-flows of regular graphs (Q2191265) (← links)
- Balanced flows for transshipment problems (Q2235277) (← links)
- Fractional matching preclusion number of graphs and the perfect matching polytope (Q2307510) (← links)
- Inequalities and existence theorems in the theory of matrices (Q2395763) (← links)
- Unimodular modules (Q2433702) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- A new approach for computing a most positive cut using the minimum flow algorithms (Q2493746) (← links)
