Cover Image

Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bozóki, Sándor, Szádoczki, Zsombor, Tekile, Hailemariam Abebe
Format:	Preprint
Published:	2020
Subjects:	Discrete Mathematics Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal sequences for pairwise comparisons: the graph of graphs approach
by: Szádoczki, Zsombor, et al.
Published: (2022)

An experimental approach: The graph of graphs
by: Szádoczki, Zsombor, et al.
Published: (2025)

Geometry of efficient weight vectors
by: Ábele-Nagy, Kristóf, et al.
Published: (2025)

The incomplete Analytic Hierarchy Process and Bradley-Terry model: (in)consistency and information retrieval
by: Gyarmati, László, et al.
Published: (2022)

An experimental approach: Converting verbal expressions to numerical scales
by: Szádoczki, Zsombor, et al.
Published: (2025)

Incomplete pairwise comparison matrices and their applications
by: Csató, László, et al.
Published: (2026)

A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
by: Ketkov, Sergey S.
Published: (2023)

Scheduling on identical machines with conflicts to minimize the mean flow time
by: Tellache, Nour ElHouda, et al.
Published: (2025)

Polytopes of alternating sign matrices with dihedral-subgroup symmetry
by: Madarasi, Péter
Published: (2026)

A clustering approach for pairwise comparison matrices
by: Ágoston, Kolos Csaba, et al.
Published: (2024)

Complexity of polytope diameters via perfect matchings
by: Nöbel, Christian, et al.
Published: (2024)

Minimum 0-Extension Problems on Directed Metrics
by: Hirai, Hiroshi, et al.
Published: (2020)

Minimum Cut Representability of Stable Matching Problems
by: Faenza, Yuri, et al.
Published: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
by: Alidaee, Bahram, et al.
Published: (2024)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
by: Moldenhauer, Carsten, et al.
Published: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
by: Proença, Nathan Benedetto, et al.
Published: (2026)

Geoffrion's theorem beyond finiteness and rationality
by: Dey, Santanu S., et al.
Published: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
by: Wang, Changjun, et al.
Published: (2026)

On the Virtual Network Embedding polytope
by: Benhamiche, Amal, et al.
Published: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
by: Jabbari-Marand, Behnam, et al.
Published: (2026)

Shortest Paths in Graphs of Convex Sets
by: Marcucci, Tobia, et al.
Published: (2021)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
by: Bernardelli, Ambrogio Maria, et al.
Published: (2024)

Order acceptance and scheduling in capacitated job shops
by: Linß, Florian, et al.
Published: (2024)

A review of minimum cost box searching games
by: Lidbetter, Thomas
Published: (2025)

Market proliferation and the impact of locational complexity on network restructuring
by: Pinar-Pérez, J. M., et al.
Published: (2024)

On Supportedness in Multi-Objective Combinatorial Optimization
by: Könen, David, et al.
Published: (2025)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
by: Swamy, Rahul, et al.
Published: (2024)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
by: Del Pia, Alberto
Published: (2025)

An exact approach for the multi-depot electric vehicle scheduling problem
by: Haslinger, Xenia, et al.
Published: (2025)

Factorized binary polynomial optimization
by: Del Pia, Alberto
Published: (2024)

Rank-one Boolean tensor factorization and the multilinear polytope
by: Del Pia, Alberto, et al.
Published: (2022)

Projection-width as a structural parameter for discrete separable optimization
by: Del Pia, Alberto
Published: (2025)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
by: Baeckelant, Timothy, et al.
Published: (2026)

Chorded cycle facets of the clique partitioning polytope
by: Irmai, Jannik, et al.
Published: (2024)

Normalizations of factorizations over convex cones and their effects on extension complexity
by: Brown, Adam, et al.
Published: (2025)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
by: Lucci, Mauro, et al.
Published: (2026)

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

Revisiting some classical linearizations of the quadratic binary optimization problem
by: Punnen, Abraham P., et al.
Published: (2024)

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
by: Wu, Fei, et al.
Published: (2024)