scientific article; zbMATH DE number 3580570

Cited in

(only showing first 100 items - show all)

Recent results on well-balanced orientations
Some sequences associated with combinatorial structures
\(M\)-convex functions and tree metrics
Ranking tournaments with no errors. II: Minimax relation
Computing weighted strength and applications to partitioning
Submodular function minimization and polarity
Convexity of graph-restricted games induced by minimum partitions
Characterizing and recognizing generalized polymatroids
The value function of an integer program
On the Galois lattice of bipartite distance hereditary graphs
Extended cuts
A primal dual integer programming algorithm
On total dual integrality
Structural theorems for submodular functions, polymatroids and polymatroid intersections
The max-flow min-cut property and \(\pm 1\)-resistant sets
Non-standard approaches to integer programming
A discrete convex min-max formula for box-TDI polyhedra
Perfect, ideal and balanced matrices
Tree-representation of set families and applications to combinatorial decompositions
A Unified Framework for Pricing in Nonconvex Resource Allocation Games
The Minimum Weight In-Tree Cover Problem
A decomposition of the matroids with the max-flow min-cut property
A note on Frank's generalized polymatroids
On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
Dijkstra's algorithm and L-concave function maximization
Total dual integrality and integer polyhedra
Totally tight Chvatal-Gomory cuts
A Representation Theorem for Union-Difference Families and Application
On a composition of independence systems by circuit identification
Submodular linear programs on forests
Lattice polyhedra and submodular flows
The nucleon of cooperative games and an algorithm for matching games
Solution of two fractional packing problems of Lovász
Packing cycles exactly in polynomial time
A notion of total dual integrality for convex, semidefinite, and extended formulations
Idealness of \(k\)-wise intersecting families
Minimizing a sum of submodular functions
Polyhedra related to a lattice
Abstract flows over time: a first step towards solving dynamic packing problems
On some algorithmic aspects of hypergraphic matroids
Computation and efficiency of potential function minimizers of combinatorial congestion games
Total dual integrality implies local strong unimodularity
A flow model based on polylinking system
On the core of network synthesis games
Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality
An application of submodular flows
Intersecting restrictions in clutters
Note on inverse problem with l_ objective function
The ellipsoid method and its consequences in combinatorial optimization
Clique partitioning of interval graphs with submodular costs on the cliques
Directed submodularity, ditroids and directed submodular flows
Graph covers using \(t\)-colourable vertex sets.
Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
Greedy oriented flows
Inheritance of convexity for partition restricted games
The \(b\)-branching problem in digraphs
Randomized algorithms for finding the shortest negative cost cycle in networks
Solution of two fractional packing problems of Lovász. (Reprint)
A fast cost scaling algorithm for submodular flow
On switching paths polyhedra
Duality for balanced submodular flows
Polymatroidal flows with lower bounds
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
Hypergraphs with polynomial representation: introducing \(r\)-splits
Polyhedral structure of submodular and posi-modular systems
Path-closed sets
A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming
The box-TDI system associated with 2-edge connected spanning subgraphs
An algorithm for minimum cost arc-connectivity orientations
Packing circuits in matroids
On Packing Dijoins in Digraphs and Weighted Digraphs
Ideal clutters
On totally dual integral systems
Cutting planes from a mixed integer Farkas lemma.
Canonical decompositions of symmetric submodular systems
A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows
Finding feasible vectors of Edmonds-Giles polyhedra
Linear and combinatorial sharing problems
Discrete extremal problems
When is the matching polytope box-totally dual integral?
Coordinatewise domain scaling algorithm for M-convex function minimization
A capacity scaling algorithm for M-convex submodular flow
The complexity of recognizing linear systems with certain integrality properties
Operations that preserve total dual integrality
Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
The b‐bibranching problem: TDI system, packing, and discrete convexity
Optimal matching forests and valuated delta-matroids
A counterexample to a conjecture of Edmonds and Giles
Total dual dyadicness and dyadic generating sets
A strongly polynomial minimum cost circulation algorithm
A weak box-perfect graph theorem
An out-of-kilter method for submodular flows
An application of simultaneous diophantine approximation in combinatorial optimization
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
Finite checkability for integer rounding properties in combinatorial programming problems
Superadditive characterizations of pure integer programming feasibility
Generalized polymatroids and submodular flows
Finding popular branchings in vertex-weighted digraphs

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