Results 111 to 120 of about 7,009 (143)

Polyhedral Combinatorics of Benzenoid Problems

1998
Many chemical properties of benzenoid hydrocarbons can be understood in terms of the maximum number of mutually resonant hexagons, or Clar number, of the molecules. Hansen and Zheng (1994) formulated this problem as an integer program and conjectured, based on computational evidence, that solving the linear programming relaxation always yields integral
Hernán Abeledo, Gary Atkinson
openaire   +1 more source

Nondecomposable solutions to group equations and an application to polyhedral combinatorics

4OR, 2006
This 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, Matthias Köppe, Robert Weismantel   +2 more
openaire   +1 more source

Topics of polyhedral combinatorics in transportation problems with exclusions

Cybernetics, 1991
We 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

Polyhedral methods applied to extremal combinatorics problems

2014
Wir 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

Edmonds, matching and the birth of polyhedral combinatorics

2012
It 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

One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics

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

SU(3)×𝒮₂₀ algebras for uniform spin‐1 ensembles on [²H¹²C]₂₀, or [¹⁴N]₂₀, dodecahedrane‐type lattices and analogous isotopomeric [M₂₀¹²C₄₀] met‐carb subensembles: M‐based cardinalities and completeness of 𝒮₂₀ spin irreps, via hierarchical {𝒞^{λ⊢(n=20):(M)}} designs of polyhedral combinatorics*

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

Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations

1998
For the classical quadratic assignment problem (QAP) that requires n objects to be assigned to n locations (the n × n-case), polyhe- dral studies have been started in the very recent years by several authors. In this paper, we investigate the variant of the QAP, where the number of locations may exceed the number of objects (the m × n-case).
openaire   +1 more source

Recent Advances in Polyhedral Combinatorics

2018
Combinatorial optimization searches for an optimal object in a nite collection; typically the collection has a concise representation while the number of objects is huge. Polyhedral and linear programming techniques have proved to be very powerful and successful in tackling various combinatorial optimization problems, and the end products of these ...
openaire   +3 more sources

Polyhedral Combinatorics

2005
Robert D. Carr, Goran Konjevod
openaire   +1 more source