scientific article
From MaRDI portal
Publication:3274170
zbMath0096.00606MaRDI QIDQ3274170
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Computing maximum mean cuts, Packing spanning trees in highly essentially connected graphs, Metric and ultrametric inequalities for directed graphs, A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges, Stronger multi-commodity flow formulations of the capacitated vehicle routing problem, Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem, On \(k\)-strong and \(k\)-cyclic digraphs, Colouring series-parallel graphs, A system of linear equations related to the transportation problem with application to probability theory, Comparison of formulations for the inventory routing problem, Inequalities and existence theorems in the theory of matrices, Generalized polymatroids and submodular flows, How to compute least infeasible flows, Matrix scaling, entropy minimization, and conjugate duality. I: Existence conditions, Consistency, redundancy, and implied equalities in linear systems, Flows, view obstructions, and the lonely runner, Cycle selections, Spanning eulerian subdigraphs in semicomplete digraphs, Rao's degree sequence conjecture, Odd Solutions to Systems of Inequalities Coming From Regular Chain Groups, Circular zero-sum \(r\)-flows of regular graphs, Total unimodularity and combinatorial theorems, The time dependent traveling salesman problem: polyhedra and algorithm, Unimodular modules, Flows and parity subgraphs of graphs with large odd-edge-connectivity, A Privacy-Preserving Method to Optimize Distributed Resource Allocation, Matroids and multicommodity flows, Optimal cocircuits in regular matroids and applications, Matrices of zeros and ones, Circular flow on signed graphs, An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem, A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem, A flow based pruning scheme for enumerative equitable coloring algorithms, A polynomial time algorithm for the minimum flow problem in time-varying networks, Balanced flows for transshipment problems, The flow index and strongly connected orientations, The travelling preacher, projection, and a lower bound for the stability number of a graph, Matching theory -- a sampler: From Dénes König to the present, Complexity of minimum irreducible infeasible subsystem covers for flow networks, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Complexity and algorithms for nonlinear optimization problems, What the transportation problem did for me, On the subdifferential of a submodular function, Possible line sums for a qualitative matrix, Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach, A new approach for computing a most positive cut using the minimum flow algorithms, A new algorithm for solving the feasibility problem of a network flow, An analogue of Hoffman's circulation conditions for max-balanced flows, Systems of representatives, Fractional matching preclusion number of graphs and the perfect matching polytope, Integral infeasibility and testing total dual integrality, Characterizing multiterminal flow networks and computing flows in networks of small treewidth, Basic Terminology, Notation and Results, The flow circulation sharing problem, Decreasing minimization on M-convex sets: algorithms and applications, Financial systems: A few theoretical and algebraic considerations for their modeling, Polynomials associated with nowhere-zero flows, Finding feasible vectors of Edmonds-Giles polyhedra, Balanced matrices, Matching, Euler tours and the Chinese postman, Approximate binary search algorithms for mean cuts and cycles, The facets of the polyhedral set determined by the Gale-Hoffman inequalities, Some sequences associated with combinatorial structures, Compact formulations of the Steiner traveling salesman problem and related problems
