Copertina

Adapting Polyhedral Dominance Cones to Ordinal Preference Structures

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Klamroth, Kathrin, Stiglmayr, Michael, Santos, Julia Sudhoff
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
di: Figueira, José Rui, et al.
Pubblicazione: (2024)

Event-based MILP models for ride pooling applications
di: Gaul, Daniela, et al.
Pubblicazione: (2021)

A Tight Formulation for the Dial-a-Ride Problem
di: Gaul, Daniela, et al.
Pubblicazione: (2023)

Computing safe bicycle routes -- Berechnung sicherer Fahrradwege
di: Santos, Julia Sudhoff, et al.
Pubblicazione: (2024)

Polyhedral study of a temporal rural postman problem: application in inspection of railway track without disturbing train schedules
di: Buriuly, Somnath, et al.
Pubblicazione: (2024)

Monotonicity and Contraction on Polyhedral Cones
di: Jafarpour, Saber, et al.
Pubblicazione: (2022)

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
di: Au, Yu Hin, et al.
Pubblicazione: (2020)

An Output-Polynomial Time Algorithm to Determine all Supported Efficient Solutions for Multi-Objective Integer Network Flow Problems
di: Könen, David, et al.
Pubblicazione: (2023)

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

The Line-Based Dial-a-Ride Problem
di: Reiter, Kendra, et al.
Pubblicazione: (2024)

Finite Convergence of Circumcentered-Reflection Method on Closed Polyhedral Cones in Euclidean Spaces
di: Liao, Hongzhi
Pubblicazione: (2024)

Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem
di: Clément, François, et al.
Pubblicazione: (2024)

Existence of reciprocal matrices with specified orders for the right and inverse left Perron eigenvectors
di: Furtado, Susana, et al.
Pubblicazione: (2026)

On the minimum doubly resolving set problem in line graphs
di: Ye, Qingjie
Pubblicazione: (2026)

Computation of Set Tolerances with Applications to the Minimum Spanning Tree Problem
di: Jäger, Gerold, et al.
Pubblicazione: (2026)

On Solving the Set Covering Problem with Conflicts on Sets
di: Montemanni, Roberto, et al.
Pubblicazione: (2025)

Conformal Rigidity and Spectral Embeddings of Graphs
di: Gouveia, João, et al.
Pubblicazione: (2025)

Cutting plane methods with gradient-based heuristics
di: Bùi, Hòa T., et al.
Pubblicazione: (2025)

Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers
di: Brosch, Daniel, et al.
Pubblicazione: (2025)

Strength of the Upper Bounds for the Edge-Weighted Maximum Clique Problem
di: Ciccarelli, Fabio, et al.
Pubblicazione: (2025)

Improvements on Permutation Reconstruction from Minors
di: Ma, Yiming, et al.
Pubblicazione: (2024)

On disjunction convex hulls by lifting
di: Qu, Yushan, et al.
Pubblicazione: (2024)

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem
di: Großmann, Ernestine, et al.
Pubblicazione: (2024)

Faces of homogeneous cones and applications to homogeneous chordality
di: Gouveia, João, et al.
Pubblicazione: (2025)

Stable matchings with switching costs
di: Pittel, Boris, et al.
Pubblicazione: (2025)

Integer Carathéodory results with bounded multiplicity
di: Kuhlmann, Stefan
Pubblicazione: (2023)

The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees
di: Li, Xiao, et al.
Pubblicazione: (2023)

Low degree sum-of-squares bounds for the stability number: a copositive approach
di: Vargas, Luis Felipe, et al.
Pubblicazione: (2025)

An Efficient Algorithm for Vertex Enumeration of Arrangement
di: Dong, Zelin, et al.
Pubblicazione: (2024)

A Facet Enumeration Algorithm for Convex Polytopes
di: Yang, Yaguang
Pubblicazione: (2019)

A unified approach for domination and packing problems in graphs
di: Hinrichsen, E., et al.
Pubblicazione: (2025)

A computational study of cutting-plane methods for multi-stage stochastic integer programs
di: Bansal, Akul, et al.
Pubblicazione: (2024)

Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization
di: Leplat, Valentin, et al.
Pubblicazione: (2021)

Underlying Flag Polymatroids
di: Black, Alexander E., et al.
Pubblicazione: (2022)

A characterization of unimodular hypergraphs with disjoint hyperedges
di: Caoduro, Marco, et al.
Pubblicazione: (2024)

Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs
di: Dey, Santanu S., et al.
Pubblicazione: (2024)

Generalized algebraic connectivity of graphs in Euclidean spaces: extremal properties and bounds
di: Presenza, Juan F., et al.
Pubblicazione: (2025)

A two-player voting game in Euclidean space
di: Stylianou, Stelios
Pubblicazione: (2025)

Adaptive Softassign via Hadamard-Equipped Sinkhorn
di: Shen, Binrui, et al.
Pubblicazione: (2023)

Optimization Models for the Quadratic Traveling Salesperson Problem
di: Chen, Yuxiao, et al.
Pubblicazione: (2024)