scientific article

zbMath0072.37803MaRDI QIDQ3236252

J. G. Kruskal, Alan J. Hoffman

Publication date: 1956

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Operations ResearchBiomathematicsInsurance Mathematics

Related Items

Unimodular functions, Maximal generating degrees of powers of homogeneous ideals, Polyhedral proof methods in combinatorial optimization, The existence and computation of competitive equilibria in markets with an indivisible commodity, Discrepancy of set-systems and matrices, Determination of optimal vertices from feasible solutions in unimodular linear programming, The structure and number of global roundings of a graph, Approximation algorithms for hard capacitated \(k\)-facility location problems, Maximal determinants of combinatorial matrices, On the integer properties of scheduling set partitioning models, Restricted coloring models for timetabling, Recognizing max-flow min-cut path matrices, Strong unimodularity for matrices and hypergraphs, Optimal representations of partially ordered sets and a limit Sperner theorem, New polynomial-time algorithms for Camion bases, Total unimodularity and the Euler-subgraph problem, A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem, Unimodularity of the Clar number problem, \(L_{p}\) linear discrepancy of totally unimodular matrices, The incidence structure of subspaces with well-scaled frames, Short circuit covers for regular matroids with a nowhere zero 5-flow, Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction, Convex analysis and duality over discrete domains, Maximal generating degrees of integral closures of powers of monomial ideals, On properties of unit interval graphs with a perceptual motivation, Minimum power partial multi-cover on a line, Subspaces with well-scaled frames, Integer matrices with constraints on leading partial row and column sums, Breast cancer prediction using the isotonic separation technique, Testing additive integrality gaps, On total unimodularity of edge-edge adjacency matrices, On linear programming duality and Landau's characterization of tournament, Relevance of network theory to models of distributed/parallel processing, Complement total unimodularity, Total unimodularity and combinatorial theorems, Decomposing random mechanisms, \(N\)-fold integer programming and nonlinear multi-transshipment, A separable integer programming problem equivalent to its continual version, Trichotomy for integer linear systems based on their sign patterns, Implementation of a unimodularity test, Balanced matrices, Totally unimodular stochastic programs, Chromatic optimisation: Limitations, objectives, uses, references, Rational and integral \(k\)-regular matrices., On the enumeration of chains in regular chain-groups, Housing market short-term equilibriums maximizing linear utility functions, Cores of partitioning games, Compact formulations as a union of polyhedra, Some efficiently solvable problems over integer partition polytopes, Total dual integrality of the linear complementarity problem, A Petri net based approach for multi-robot path planning, Total unimodularity applications in bi-objective discrete optimization, Matching theory -- a sampler: From Dénes König to the present, Cost-performance tradeoffs for interconnection networks, \(k\)-integrality, an extension of total unimodularity, A decomposition theory for matroids. VII: Analysis of minimal violation matrices, Linear time algorithms for generalized edge dominating set problems, A min-max theorem for plane bipartite graphs, Discrete convexity and unimodularity. I., Integral rigid sets and periods of nonexpansive maps, Total unimodularity and the transportation problem: a generalization, A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, A heuristic method for solving integer-valued decompositional multiindex problems, Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem, A proof of Fulkerson's characterization of permutation matrices, Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), On two minimax theorems in graph, Comparing universal covers in polynomial time, Some combinatorial properties of centrosymmetric matrices, A min-max relation for stable sets in graphs with no odd-\(K_ 4\), A note on the total unimodularity of matrices, On partitions of a partially ordered set, Box-total dual integrality, box-integrality, and equimodular matrices, Local unimodularity of matrix-vector pairs, The edge-coloring of complete hypergraphs. I, Extremal configurations and decomposition theorems. I, Red-blue covering problems and the consecutive ones property, Extreme points of Leontief substitution systems, A min-max relation for the partial q-colourings of a graph. II: Box perfection, Optimisation and hypergraph theory, A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors, Anti-blocking polyhedra, Equilibrium in an exchange economy with multiple indivisible commodities and money, On totally dual integral systems, A characterization of the orientations of ternary matroids, Edmonds polytopes and a hierarchy of combinatorial problems, Lineare Programme und allgemeine Vertretersysteme, Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights, Extending Greene's theorem to directed graphs, The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price, On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties, Recent trends in combinatorial optimization, Packing and covering of crossing families of cuts, Integer plane multiflow maximisation: one-quarter-approximation and gaps, Set characterizations and convex extensions for geometric convex-hull proofs, Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production technologies, Network tomography for integer-valued traffic, Two simple applications of the unmodularity property, Some sequences associated with combinatorial structures, The generalized assignment problem with minimum quantities, Semiantichains and Unichain Coverings in Direct Products of Partial Orders, A decomposition property of polyhedra, Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation, A Polytope for a Product of Real Linear Functions in 0/1 Variables, Flots et tensions dans un graphe, Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection, The bipartite Boolean quadric polytope, Stable matching: An integer programming approach, Partial Colorings of Unimodular Hypergraphs, Comparing Universal Covers in Polynomial Time, The enemy of my enemy is my friend: new conditions for network games, On polynomially solvable constrained input selections for fixed and switched linear structured systems, Maximum-Minimum Sätze über Graphen, Structural properties and recognition of restricted and strongly unimodular matrices, A matrix criterion for structural balance, Matrices of rational integers, Convex polytopes all of whose reverse lexicographic initial ideals are squarefree, Typical performance of approximation algorithms for NP-hard problems, Trichotomy for the reconfiguration problem of integer linear systems, A constructive method to recognize the total unimodularity of a matrix, I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications, Extended formulations in combinatorial optimization, Über reguläre Kettengruppen, Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems, On totally unimodular matrices, Local optimality subsets and global optimization: A prospective approach, Extended formulations in combinatorial optimization, Convexity and global optimization: A theoretical link, Perfect, ideal and balanced matrices, On the use of alternating chains and hypergraphs in edge coloring, Unimodular matrices of flow problems with additional constraints, Graphic matroids and the multicommodity transportation problem, Subdeterminants and Concave Integer Quadratic Programming, Compactifications of the Generalized Jacobian Variety, Poincaré-Hopf inequalities, Structural Search and Optimization in Social Networks, Connected and alternating vectors: Polyhedra and algorithms, Systems of representatives, On some characterisations of totally unimodular matrices, Disjoint (s, t)‐cuts in a network, The Number of Solutions to Linear Diophantine Equations and Multivariate Splines, Resistant Sets in the Unit Hypercube, Integral decomposition in polyhedra, Polynomial algorithms for a class of linear programs, Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow, Balanced matrices, 2-Modular Matrices