scientific article; zbMATH DE number 3185974

Cited in

(68)

Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems
Partial Colorings of Unimodular Hypergraphs
Integrality in the multinetwork min‐cost equal‐flow problem
An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem
Block-structured integer programming: can we parameterize without the largest coefficient?
On the gap between hereditary discrepancy and the determinant lower bound
LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS
Tool switching problems in the context of overlay printing with multiple colours
On locally-balanced 2-partitions of bipartite graphs
Structural properties and recognition of restricted and strongly unimodular matrices
Constrained minimum-$k$-star clustering and its application to the consolidation of farmland
Implementation of a unimodularity test
On pseudomatroid property of matrices
The Mixing Set with Divisible Capacities
Recoverable robust representatives selection problems with discrete budgeted uncertainty
On a Class of Totally Unimodular Matrices
Staircase compatibility and its applications in scheduling and piecewise linearization
A triplet-based exact method for the shift minimisation personnel task scheduling problem
Discrepancy of set-systems and matrices
Fixed-charge transportation on a path: optimization, LP formulations and separation
Directed submodularity, ditroids and directed submodular flows
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
On some characterisations of totally unimodular matrices
Characterization of Totally Unimodular Matrices
Schottky algorithms: Classical meets tropical
Box-total dual integrality, box-integrality, and equimodular matrices
Good and nice colorings of balanced hypergraphs
Convex hull results for generalizations of the constant capacity single node flow set
A decomposition of strongly unimodular matrices into incidence matrices of digraphs
The integrality number of an integer program
On the representability of totally unimodular matrices on bidirected graphs
Some sequences associated with combinatorial structures
Minimizing the number of apertures in multileaf collimator sequencing with field splitting
Packing and covering of crossing families of cuts
Relaxations for two-level multi-item lot-sizing problems
Colorings of $k$-balanced matrices and integer decomposition property of related polyhedra
Flots et tensions dans un graphe
Chromatic optimisation: Limitations, objectives, uses, references
Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT
Optimal mechanism design for the private supply of a public good
Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics
A decomposition theory for matroids. VII: Analysis of minimal violation matrices
An integral LP relaxation for a drayage problem
A characterization of unimodular orientations of simple graphs
Exploiting complete linear descriptions for decentralized power market problems with integralities
Recent progress on combinatorics and algorithms for low discrepancy roundings
Decision support for strategic energy planning: a robust optimization framework
On total unimodularity of edge-edge adjacency matrices
Linear time algorithms for generalized edge dominating set problems
Graph coloring inequalities from all-different systems
On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
Red-blue covering problems and the consecutive ones property
Rooted $k$-connections in digraphs
Balanced $0,\pm 1$-matrices, bicoloring and total dual integrality
Dioïds and semirings: Links to fuzzy sets and other applications
Totally unimodular stochastic programs
Complement total unimodularity
Forbidden configurations, discrepancy and determinants
Total unimodularity and the Euler-subgraph problem
Optimisation and hypergraph theory
Balanced $0,\pm 1$ matrices. I: Decomposition
Semidefinite optimization in discrepancy theory
Balanced matrices
A compact reformulation of the two-stage robust resource-constrained project scheduling problem
Totally unimodular multistage stochastic programs
Robust recoverable and two-stage selection problems
Polyhedral proof methods in combinatorial optimization
Totally balanced and totally unimodular matrices defined by center location problems

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 Q5722271)