scientific article
From MaRDI portal
Publication:3236253
zbMath0072.37804MaRDI QIDQ3236253
No author found.
Publication date: 1956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (49)
Minimizing maximum indegree ⋮ Flots et tensions dans un graphe ⋮ Cost-Sharing Models in Participatory Sensing ⋮ Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws ⋮ Mathematical programming approaches for classes of random network problems ⋮ A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem ⋮ Maximum margin partial label learning ⋮ Double ramification cycles on the moduli spaces of curves ⋮ Subspaces with well-scaled frames ⋮ Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality ⋮ On a class of mixed-integer sets with a single integer variable ⋮ On linear programming duality and Landau's characterization of tournament ⋮ Complement total unimodularity ⋮ The knapsack problem with forfeit sets ⋮ On unimodular graphs with a unique perfect matching ⋮ On the \(k\)-strong Roman domination problem ⋮ Nash balanced assignment problem ⋮ Discrete extremal problems ⋮ Balanced matrices ⋮ Signed graphs ⋮ Rational and integral \(k\)-regular matrices. ⋮ Housing market short-term equilibriums maximizing linear utility functions ⋮ Extracting pure network submatrices in linear programs using signed graphs. ⋮ A constructive method to recognize the total unimodularity of a matrix ⋮ Robust strategic planning for mobile medical units with steerable and unsteerable demands ⋮ On matrices with the Edmonds-Johnson property arising from bidirected graphs ⋮ A decomposition of strongly unimodular matrices into incidence matrices of digraphs ⋮ Extended formulations in combinatorial optimization ⋮ A characterization of the uncapacitated network design polytope ⋮ Permutation betting markets: singleton betting with extra information ⋮ Extended formulations in combinatorial optimization ⋮ Models and methods for standardization problems ⋮ Time-slot assignment for TDMA-systems ⋮ Assignment problems with changeover cost ⋮ A proof of Fulkerson's characterization of permutation matrices ⋮ A polynomial case of the parsimony haplotyping problem ⋮ Some combinatorial properties of centrosymmetric matrices ⋮ Graphic matroids and the multicommodity transportation problem ⋮ Inside-out polytopes ⋮ Box-total dual integrality, box-integrality, and equimodular matrices ⋮ Nullstellensatz size-degree trade-offs from reversible pebbling ⋮ Locally orderless tracking ⋮ Compactifications of the Generalized Jacobian Variety ⋮ Extremal configurations and decomposition theorems. I ⋮ Systems of representatives ⋮ Lineare Programme und allgemeine Vertretersysteme ⋮ Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights ⋮ The simple plant location problem: Survey and synthesis ⋮ A Note on Appointment Scheduling with Piecewise Linear Cost Functions
This page was built for publication:
