Results 171 to 180 of about 46,626 (239)

Cutting Planes in Combinatorics

European Journal of Combinatorics, 1985
The author uses two combinatorial problems: packing diamonds into a Chinese checkerboard nd Deza's proof of a conjecture of Erdős and Lovàsz [\textit{M. Deza}, J. Comb. Theory, Ser. B, 16, 166-167 (1974; Zbl 0263.05007)] to illustrate how Gomory's cutting plane method for solving integer linear programming problems can be used to solve combinatorial ...
openaire   +2 more sources

Response to a report published by the Office for Risk Assessment & Research of the Netherlands Food and Product Safety Authority on three EFSA quantitative pest risk assessments

EFSA Journal, Volume 24, Issue 6, June 2026.
Abstract A report commenting on three quantitative pest risk assessments (qPRA) of the EFSA PLH Panel (Panel) was published in November 2025 by the Office for Risk Assessment & Research (BuRO) of the Netherlands Food and Product Safety Authority. In that report, the approaches applied by the Panel in three qPRA were narratively scrutinised against an ...
EFSA Panel on Plant Health (PLH), Paula Baptista, Anna Berlin, Elisavet Chatzivassiliou, Jaime Cubero, Nik Cunniffe, Eduardo de la Peña, Nicolas Desneux, Francesco Di Serio, Anna Filipiak, Paolo Gonthier, Beata Hasiów‐Jaroszewska, Hervé Jactel, Blanca B. Landa, Lara Maistrello, David Makowski, Panagiotis Milonas, Nikos T. Papadopoulos, Roel Potting, Hanna Susi, Hans‐Hermann Thulke, Matteo Crotta, Ewelina Czwienczek, Olaf Mosbach‐Schulz, Marco Pautasso, Giuseppe Stancanelli, Antonio Vicent Civera   +26 more
wiley   +1 more source

Combinatorics: The Art of Counting

Graduate Studies in Mathematics, 2020
Bruce E. Sagan
semanticscholar   +1 more source

Lattice Path Combinatorics and Interactions

International audienceLattice paths are a fundamental concept in combinatorics, providing a geometric perspective on many counting problems. By mapping problems onto a lattice, mathematicians can exploit symmetry, recursion, and combinatorial identities ...
Banderier, Cyril, Wallner, Michael, Krattenthaler, Christian   +2 more
core  

Decomposing dense bipartite graphs into 4-cycles

, 2015
Let G be an even bipartite graph with partite sets X and Y such that |Y | is even and the minimum degree of a vertex in Y is at least 95|X|/96. Suppose furthermore that the number of edges in G is divisible by 4.
Nicholas J. Cavenagh, Cavenagh, Nicholas J.   +1 more
core  

The combinatorics and complexity of integer sequences

, 2018
I will give a broad review of classes of integer sequences arising in combinatorics. Beside the more traditional asymptotic results, I will also emphasize the complexity aspects. Many examples will be presented.
Pak, Igor
core  

Recent Advances in Polyhedral Combinatorics

, 2017
Combinatorial optimization searches for an optimal object in a finite collection; typically the collection has a concise representation while the number of objects is huge.
Zang, W
core  

Sortable Elements for Quivers with Cycles [PDF]

, 2009
Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W.
Speyer, David E., Reading, Nathan
core  

Penalty method for unilateral contact problem with Coulomb's friction in time-fractional derivatives

Demonstratio Mathematica
The purpose of this work is to study a mathematical model that describes a contact between a deformable body and a rigid foundation. A linear viscoelastic Kelvin-Voigt constitutive law with time-fractional derivatives describes the material’s behavior ...
Essafi Lakbir, Bouallala Mustapha
doaj   +1 more source

Combinatorics and Complexity of Partition Functions

Algorithms and Combinatorics, 2017
A. Barvinok
semanticscholar   +1 more source