Results 101 to 110 of about 6,993 (154)
Polyhedral Combinatorics and the Acyclic Subdigraph Problem by M. Junger
openaire +1 more source
Weight functions, double reciprocity laws, and volume formulas for lattice polyhedra. [PDF]
Chen B.
europepmc +1 more source
Inferring genetic interactions from comparative fitness data. [PDF]
Crona K +3 more
europepmc +1 more source
Tropical geometry of statistical models. [PDF]
Pachter L, Sturmfels B.
europepmc +1 more source
An amino acid code to define a protein's tertiary packing surface. [PDF]
Fraga KJ, Joo H, Tsai J.
europepmc +1 more source
Parametric inference for biological sequence analysis. [PDF]
Pachter L, Sturmfels B.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Polyhedral Combinatorics in Combinatorial Optimization
Statistica Neerlandica, 1987Polyhedral 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

