arXiv (All)
open access
Adapting Polyhedral Dominance Cones to Ordinal Preference Structures
In combinatorial optimization, ordinal costs can be used to model the quality of elements whenever numerical values are not available. When considering, for example, routing problems for cyclists, the safety of a street can be ranked in ordered categories like safe (separate bike lane), medium safe
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Exact and extremal values of chromatic villainy#1297932
- Graph4BiLO: Graph Neural Network Approximation for Bilevel Mixed-Integer Linear Optimization#799333
- Graph4BiLO: Graph Neural Network Approximation for Bilevel Mixed-Integer Linear Optimization#797910
- Increasing Dominance With No Efficiency Effect#942274
- Biproportional allocation of parliamentary seats via vector apportionment and minimum paths#991242
Record · ID 1325074
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive