scientific article; zbMATH DE number 3121294
From MaRDI portal
Publication:3236253
Cited in
(53)- On the dominant of the multicut polytope
- From finite vector field data to combinatorial dynamical systems in the sense of Forman
- Constrained optimization of rank-one functions with indicator variables
- Inside-out polytopes
- Extremal configurations and decomposition theorems. I
- On unimodular graphs with a unique perfect matching
- Systems of representatives
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
- Lineare Programme und allgemeine Vertretersysteme
- Maximum margin partial label learning
- A proof of Fulkerson's characterization of permutation matrices
- Box-total dual integrality, box-integrality, and equimodular matrices
- A polynomial case of the parsimony haplotyping problem
- A decomposition of strongly unimodular matrices into incidence matrices of digraphs
- Some combinatorial properties of centrosymmetric matrices
- Nullstellensatz size-degree trade-offs from reversible pebbling
- A note on appointment scheduling with piecewise linear cost functions
- On the \(k\)-strong Roman domination problem
- Permutation betting markets: singleton betting with extra information
- Polynomial time reachability analysis in discrete state chemical reaction networks obeying conservation laws
- Subspaces with well-scaled frames
- Flots et tensions dans un graphe
- Compactifications of the Generalized Jacobian Variety
- On linear programming duality and Landau's characterization of tournament
- Double ramification cycles on the moduli spaces of curves
- Extended formulations in combinatorial optimization
- Graphic matroids and the multicommodity transportation problem
- A constructive method to recognize the total unimodularity of a matrix
- Extracting pure network submatrices in linear programs using signed graphs.
- Rational and integral \(k\)-regular matrices.
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
- Minimizing maximum indegree
- The knapsack problem with forfeit sets
- Assignment problems with changeover cost
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
- Complement total unimodularity
- Time-slot assignment for TDMA-systems
- Robust strategic planning for mobile medical units with steerable and unsteerable demands
- Mathematical programming approaches for classes of random network problems
- A characterization of the uncapacitated network design polytope
- On matrices with the Edmonds-Johnson property arising from bidirected graphs
- Discrete extremal problems
- The simple plant location problem: Survey and synthesis
- Models and methods for standardization problems
- Housing market short-term equilibriums maximizing linear utility functions
- Locally orderless tracking
- On a class of mixed-integer sets with a single integer variable
- Extended formulations in combinatorial optimization
- Cost-sharing models in participatory sensing
- Signed graphs
- Balanced matrices
- Polynomial time coverability analysis in discrete state chemical reaction network subclasses
- Nash balanced assignment problem
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 Q3236253)
