Skip to search formSkip to main contentSkip to account menu

Total dual integrality

Known as: TDI 
In mathematical optimization, total dual integrality is a sufficient condition for the integrality of a polyhedron. Thus, the optimization of a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We prove that every pointed closed convex set in $\mathbb{R}^n$ is the intersection of all the rational closed halfspaces that… 
2015
2015
A graph G is called A-integral (L-integral, Q-integral, S-integral) if the spectrum of its adjacency (Laplacian, signless… 
2013
2013
One of the most important logic constraints is the constraint of difference. It is imposed on a set of discrete variables… 
2012
2012
Facility location, arising in a rich variety of applications, has been studied extensively in the fields of operations research… 
2011
2011
When R is a non-archimedean real closed field we say that a func- tion f 2 R( ¯ X) is finitary at a pointb 2 R n if on some… 
2011
2011
Definition 1.1. A matrix A ∈ Zm×n is totally unimodular if the determinant of every square submatrix B ∈ Zk×k equals either −1, 0… 
2007
2007
In this paper we provide new characterizing properties of TDI systems, among others the following: A system of linear… 
2002
2002
We provide a new class of matrices, called binet matrices (de noted byB), which guarantee half-integral vertices for the… 
Review
1999
Review
1999
On the spring of 1994, while preparing a survey-paper on graph-connectivity augmentation problems, I read and heard of several… 
1991
1991
  • W. Wu
  • 1991
  • Corpus ID: 124870747
Let S be a fin ite set, and f be a real valued function defined on the subsets of S. Coneepts of discrete convex funotion are…