Results 101 to 110 of about 145 (122)
Some of the next articles are maybe not open access.
Polyhedral combinatorics: dedicated to the memory of D.R. Fulkerson
European Journal of Operational Research, 1981exaly +2 more sources
Polyhedral Combinatorics and Network Reliability
Mathematics of Operations Research, 1986This paper studies the reliability of systems comprised of variables which must satisfy a set of linear equalities and nonnegativity constraints, and which are subject to random failure. A major example, which will be given special emphasis, is the reachability (source-to-all connectedness reliability) problem for stochastic networks.
openaire +2 more sources
Information theory and polyhedral combinatorics
2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015The theory of extended formulations is concerned with the optimal polyhedral representation of a (combinatorial) optimization problem. In this context, information-theoretic methods recently gained significant attention as a convenient way to provide strong lower bounds on the size of such representations. We will provide an introduction to information-
openaire +1 more source
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
4OR, 2006This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear programs. In this paper, we present an algorithm for efficiently computing this set.
Matthias Jach +2 more
openaire +1 more source
Polyhedral combinatorics of multi-index axial transportation problems
European Journal of Operational Research, 2008For the \(p\)-index axial transportation polytope, the authors establish criteria for the minimum and maximum number of integer points and describe the class of polytopes for which the number of integer points coincides with the number of integer vertices.
M. K. Kravtsov, E. V. Lukshin
openaire +2 more sources
Topics of polyhedral combinatorics in transportation problems with exclusions
Cybernetics, 1991We derive a number of new results for \(k\)-regular transportation polyhedra (TPs) with a given number of faces: fairly accurate upper bounds for the minimum and lower bounds for the maximum number of vertices; achievable upper and lower bounds on the diameter and the radius.
openaire +2 more sources
Edmonds, matching and the birth of polyhedral combinatorics
2012It is always good to read the history and learn from it. An extra volume of \textit{Documenta Mathematica}, \textit{Optimization Stories}, provides wonderful reviews on historical people, events and important results in the field of optimization. The paper is one of those which appear in this volume.
openaire +2 more sources
Polyhedral methods applied to extremal combinatorics problems
2014Wir untersuchen Polytope, die zwei bekannte Probleme beschreiben: das Hypergraphen-Problem von Turán und die Vermutung von Frankl. Das Hypergraphen-Problem von Turán bestimmt die maximale Anzahl der r-Kanten in einem r-Hypergraph mit n Knoten, so dass der daraus entstandene r-Teil-Hypergraph keine Clique der Größe a enthält.
openaire +2 more sources
Neural Computation, 2007
According to the proof by Liu, Chiu, and Xu (2004) on the so-called one-bit-matching conjecture (Xu, Cheung, and Amari, 1998a), all the sources can be separated as long as there is an one-to-one same-sign correspondence between the kurtosis signs of all source probability density functions (pdf's) and the kurtosis signs of all model pdf's, which is ...
openaire +3 more sources
According to the proof by Liu, Chiu, and Xu (2004) on the so-called one-bit-matching conjecture (Xu, Cheung, and Amari, 1998a), all the sources can be separated as long as there is an one-to-one same-sign correspondence between the kurtosis signs of all source probability density functions (pdf's) and the kurtosis signs of all model pdf's, which is ...
openaire +3 more sources
International Journal of Quantum Chemistry, 2002
AbstractThe M‐based hierarchy cardinalities of spin irreps for \documentclass{article}\pagestyle{empty}\begin{document}$[A]_{20}^{(I_{i}=1)}$\end{document} uniform nuclear magnetic resonance (NMR) /isotopomer spin ensembles are derived. Such ideas define the completeness of the number‐partition‐based (intermediate) combinatorial designs (on M ...
openaire +1 more source
AbstractThe M‐based hierarchy cardinalities of spin irreps for \documentclass{article}\pagestyle{empty}\begin{document}$[A]_{20}^{(I_{i}=1)}$\end{document} uniform nuclear magnetic resonance (NMR) /isotopomer spin ensembles are derived. Such ideas define the completeness of the number‐partition‐based (intermediate) combinatorial designs (on M ...
openaire +1 more source