Results 81 to 90 of about 26,105 (190)
Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation
Journal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini +3 more
wiley +1 more source
Personalized and Explainable Aspect‐Based Recommendation Using Latent Opinion Groups
Computational Intelligence, Volume 42, Issue 2, April 2026.ABSTRACT The problem of explainable recommendation—supporting the recommendation of a product or service with an explanation of why the item is a good choice for the user—is attracting substantial research attention recently. Recommendations associated with an explanation of how the aspects of the chosen item may meet the needs and preferences of the ...
Maryam Mirzaei +2 more
wiley +1 more source
The irregularity of graphs under graph operations
Discussiones Mathematicae Graph Theory, 2014 The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj +1 more source
Lexicographic Products of Half Linearly Ordered Groups [PDF]
Czechoslovak Mathematical Journal, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Hausdorff dimension of double‐base expansions and binary shifts with a hole
Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.Abstract For two real bases q0,q1>1$q_0, q_1 > 1$, a binary sequence i1i2⋯∈{0,1}∞$i_1 i_2 \cdots \in \lbrace 0,1\rbrace ^\infty$ is the (q0,q1)$(q_0,q_1)$‐expansion of the number πq0,q1(i1i2⋯)=∑k=1∞ikqi1⋯qik.$$\begin{equation*} \pi _{q_0,q_1}(i_1 i_2 \cdots) = \sum _{k=1}^\infty \frac{i_k}{q_{i_1} \cdots q_{i_k}}.
Jian Lu, Wolfgang Steiner, Yuru Zou
wiley +1 more source
Another H-super magic decompositions of the lexicographic product of graphs
Indonesian Journal of Combinatorics, 2018 Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combination between graph decomposition and graph labeling. A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bijection
H Hendy +3 more
doaj +1 more source
Lexicographic products of GO-spaces
Topology and its Applications, 2017 \textit{M. J. Faber} [Metrizability in generalized ordered spaces. Mathematical Centre Tracts. 53. Amsterdam: Mathematisch Centrum (1974; Zbl 0282.54017)] has shown that the lexicographic order topology on a product of paracompact linearly ordered topological spaces (LOTS) is paracompact.
openaire +2 more sources
Graphical small cancellation and hyperfiniteness of boundary actions
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract We study actions of (infinitely presented) graphical small cancellation groups on the Gromov boundaries of their coned‐off Cayley graphs. We show that a class of graphical small cancellation groups, including (infinitely presented) classical small cancellation groups, admit hyperfinite boundary actions, more precisely, the orbit equivalence ...
Chris Karpinski +2 more
wiley +1 more source
Notions of Rough Neutrosophic Digraphs
Mathematics, 2018 [-3]Graph theory has numerous applications in various disciplines, including computer networks, neural networks, expert systems, cluster analysis, and image capturing. Rough neutrosophic set (NS) theory is a hybrid tool for handling uncertain information
Nabeela Ishfaq +3 more
doaj +1 more source
Discrepancy of arithmetic progressions in boxes and convex bodies
Mathematika, Volume 72, Issue 2, April 2026.Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley +1 more source