Results 101 to 110 of about 7,009 (143)

The poset of bipartitions.

Eur J Comb, 2011
Hetyei G, Krattenthaler C.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

Journal of Combinatorial Optimization, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mak, Vicky, Thomadsen, Tommy
openaire   +4 more sources

Chapter V Polyhedral combinatorics

Handbooks in Operations Research and Management Science, 1989
Wr Pulleyblank
openaire   +3 more sources

Polyhedral Combinatorics in Combinatorial Optimization

Statistica Neerlandica, 1987
Polyhedral combinatorics is a subarea of combinatorial optimization of increasing practical importance. It deals with the application of the theory of linear systems and linear algebra to combinatorial problems. The paper is not intended as a survey on polyhedral combinatorics but it reviews some of the main concepts and proof techniques.
Gerards, A.M.H., Kolen, A.W.J.
openaire   +1 more source

Polyhedral Combinatorics and Neural Networks

Neural Computation, 1994
The often disappointing performance of optimizing neural networks can be partly attributed to the rather ad hoc manner in which problems are mapped onto them for solution. In this paper a rigorous mapping is described for quadratic 0-1 programming problems with linear equality and inequality constraints, this being the most general class of problem ...
Andrew H. Gee, Richard W. Prager
openaire   +1 more source

Polyhedral Combinatorics and Network Reliability

Mathematics of Operations Research, 1986
This 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

Polyhedral combinatorics of multi-index axial transportation problems

European Journal of Operational Research, 2008
For 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.
Kravtsov, M. K., Lukshin, E. V.
openaire   +2 more sources

Information theory and polyhedral combinatorics

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015
The 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