scientific article; zbMATH DE number 3121293
From MaRDI portal
Publication:3236252
zbMATH Open0072.37803MaRDI QIDQ3236252FDOQ3236252
Authors: Alan J. Hoffman, J. G. Kruskal
Publication date: 1956
Title of this publication is not available (Why is that?)
Cited In (only showing first 100 items - show all)
- The Number of Solutions to Linear Diophantine Equations and Multivariate Splines
- Some sequences associated with combinatorial structures
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- The generalized assignment problem with minimum quantities
- Semiantichains and Unichain Coverings in Direct Products of Partial Orders
- On linear programming duality and Landau's characterization of tournament
- Optimal representations of partially ordered sets and a limit Sperner theorem
- \(k\)-integrality, an extension of total unimodularity
- Balanced matrices
- Perfect, ideal and balanced matrices
- Flots et tensions dans un graphe
- Rational and integral \(k\)-regular matrices.
- Testing additive integrality gaps
- Matrices of rational integers
- Strong unimodularity for matrices and hypergraphs
- Integral rigid sets and periods of nonexpansive maps
- A polytope for a product of real linear functions in 0/1 variables
- Decomposing random mechanisms
- Extended formulations in combinatorial optimization
- Poincaré-Hopf inequalities
- Some combinatorial properties of centrosymmetric matrices
- Red-blue covering problems and the consecutive ones property
- New polynomial-time algorithms for Camion bases
- A heuristic method for solving integer-valued decompositional multiindex problems
- Unimodularity of the Clar number problem
- Extending Greene's theorem to directed graphs
- Compact formulations as a union of polyhedra
- The existence and computation of competitive equilibria in markets with an indivisible commodity
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- Discrepancy of set-systems and matrices
- On the enumeration of chains in regular chain-groups
- Discrete convexity and unimodularity. I.
- Cores of partitioning games
- Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
- Linear time algorithms for generalized edge dominating set problems
- Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
- Integral decomposition in polyhedra
- On totally dual integral systems
- Comparing universal covers in polynomial time
- Integer matrices with constraints on leading partial row and column sums
- Matching theory -- a sampler: From Dénes König to the present
- A separable integer programming problem equivalent to its continual version
- On partitions of a partially ordered set
- Extended formulations in combinatorial optimization
- Maximal determinants of combinatorial matrices
- Balanced matrices
- On two minimax theorems in graph
- The edge-coloring of complete hypergraphs. I
- Polyhedral proof methods in combinatorial optimization
- Robust optimization of sums of piecewise linear functions with application to inventory problems
- A min-max relation for the partial q-colourings of a graph. II: Box perfection
- Chromatic optimisation: Limitations, objectives, uses, references
- Some efficiently solvable problems over integer partition polytopes
- \(N\)-fold integer programming and nonlinear multi-transshipment
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors
- Graphic matroids and the multicommodity transportation problem
- Systems of representatives
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
- A Petri net based approach for multi-robot path planning
- Structural properties and recognition of restricted and strongly unimodular matrices
- Lineare Programme und allgemeine Vertretersysteme
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- Restricted coloring models for timetabling
- On the integer properties of scheduling set partitioning models
- Unimodular functions
- Packing and covering of crossing families of cuts
- Total dual integrality of the linear complementarity problem
- Anti-blocking polyhedra
- Maximum-Minimum Sätze über Graphen
- Compactifications of the Generalized Jacobian Variety
- Recent trends in combinatorial optimization
- I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications
- The incidence structure of subspaces with well-scaled frames
- On total unimodularity of edge-edge adjacency matrices
- Implementation of a unimodularity test
- Edmonds polytopes and a hierarchy of combinatorial problems
- A characterization of the orientations of ternary matroids
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Extremal configurations and decomposition theorems. I
- Extreme points of Leontief substitution systems
- Disjoint (s, t)‐cuts in a network
- On totally unimodular matrices
- The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price
- The bipartite Boolean quadric polytope
- Comparing Universal Covers in Polynomial Time
- A min-max theorem for plane bipartite graphs
- Recognizing max-flow min-cut path matrices
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- A note on the total unimodularity of matrices
- On a variant of Flory model
- Local unimodularity of matrix-vector pairs
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
- Maximal generating degrees of powers of homogeneous ideals
- A network flow approach to a common generalization of Clar and Fries numbers
- The structure and number of global roundings of a graph
- Polynomial algorithms for a class of linear programs
- Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
- Über reguläre Kettengruppen
- Typical performance of approximation algorithms for NP-hard problems
- Total unimodularity and the transportation problem: a generalization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3236252)