Cover Image

ELECTRE TRI-nB, pseudo-disjunctive: axiomatic and combinatorial results

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bouyssou, Denis, Marchant, Thierry, Pirlot, Marc
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Axiomatic characterizations of dissimilarity orderings and distances between sets
by: Marchant, Thierry, et al.
Published: (2025)

About maximal antichains in a product of two chains:A catch-all note
by: Bouyssou, Denis, et al.
Published: (2024)

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians
by: Bénéteau, Laurine, et al.
Published: (2022)

Graph drawing applications in combinatorial theory of maturity models
by: Kajzer, Špela, et al.
Published: (2024)

Distribution of codewords on the faces of a hypercube and new combinatorial identities
by: Abdurakhmanov, Jamolidin K.
Published: (2025)

First-order logic axiomatization of metric graph theory
by: Chalopin, Jérémie, et al.
Published: (2022)

Injective and pseudo-injective polynomial equations: From permutations to dynamical systems
by: Porreca, Antonio E., et al.
Published: (2026)

Weakly modular graphs with diamond condition, the interval function and axiomatic characterizations
by: Kamalolbhavan-Sheela, Lekshmi Kamal, et al.
Published: (2024)

The Gray graph is pseudo 2-factor isomorphic
by: Abreu, Marien, et al.
Published: (2025)

A THEORETICALLY SOUND PROCEDURE FOR ELICITING THE PARAMETERS OF A VARIANT OF ELECTRE-TRI
by: Ersek Uyanık, Eda, et al.
Published: (2025)

Single machine rescheduling for new orders: properties and complexity results
by: Rener, Elena, et al.
Published: (2023)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
by: Del Pia, Alberto, et al.
Published: (2024)

Functional design of efficient and parallelizable combinatorial generators using convolution
by: He, Xi, et al.
Published: (2025)

Solving "pseudo-injective" polynomial equations over finite dynamical systems
by: Porreca, Antonio E., et al.
Published: (2025)

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
by: Montanez-Barrera, Alejandro, et al.
Published: (2022)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2023)

CAZAC sequence generation of any length with iterative projection onto unit circle: principle and first results
by: Amis, Karine, et al.
Published: (2025)

More results on the $z$-chromatic number of graphs
by: Khaleghi, Abbas, et al.
Published: (2023)

Aperiodic monotiles: from geometry to groups
by: Coulbois, Thierry, et al.
Published: (2024)

The Selection Problem in Multi-Query Optimization: a Comprehensive Survey
by: Zinchenko, Sergey, et al.
Published: (2024)

A new proof of Delahan's induced-universality result
by: Chappelon, Jonathan
Published: (2026)

Optical orthogonal codes from a combinatorial perspective
by: Huczynska, Sophie, et al.
Published: (2024)

Traversing combinatorial 0/1-polytopes via optimization
by: Merino, Arturo, et al.
Published: (2023)

Substitution discrete plane tilings with $2n$-fold rotational symmetry for odd n
by: Kari, Jarkko, et al.
Published: (2020)

A recursive linear time modular decomposition algorithm via LexBFS
by: Corneil, Derek, et al.
Published: (2007)

Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
by: Pierre, Laurent
Published: (2016)

Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
by: Berthe, Gaétan, et al.
Published: (2024)

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
by: Hörsch, Florian, et al.
Published: (2024)

Large planar $(n,m)$-cliques
by: Bandopadhyay, Susobhan, et al.
Published: (2024)

Erd\H os--Ko--Rado type results for partitions via spread approximations
by: Kupavskii, Andrey
Published: (2023)

The Graph Coloring Game on $4\times n$-Grids
by: Brosse, Caroline, et al.
Published: (2024)

The exact value of $c_1(K_{2,n})$
by: Mori, Hiroaki
Published: (2026)

Homomorphisms of (n,m)-graphs with respect to generalised switch
by: Sen, Sagnik, et al.
Published: (2022)

Characterizing and Transforming DAGs within the I-LCA Framework
by: Hellmuth, Marc, et al.
Published: (2024)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

Effective Bounds for Restricted $3$-Arithmetic Progressions in $\mathbb{F}_p^n$
by: Bhangale, Amey, et al.
Published: (2023)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
by: Kupavskii, Andrey, et al.
Published: (2025)

A generalization of Arc-Kayles
by: Dailly, Antoine, et al.
Published: (2017)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
by: Lindeberg, Anna, et al.
Published: (2024)

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
by: Frieze, Alan, et al.
Published: (2023)