Optimal monotone relabelling of partially non-monotone ordinal data

DOI10.1080/10556788.2010.507272zbMath1270.05052WikidataQ60256792 ScholiaQ60256792MaRDI QIDQ2885460

Michael Rademaker, Bernard De Baets, H. E. De Meyer

Publication date: 23 May 2012

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2010.507272

zbMATH Keywords

maximum cut; maximum independent set; ordinal data; flow network; monotonicity relabelling

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

94C15: Applications of graph theory to circuits and networks

05C21: Flows in graphs

Related Items

Representations of votes facilitating monotonicity-based ranking rules: from votrix to votex, Aggregation of monotone reciprocal relations with application to group decision making, Supervised ranking in the WEKA environment, On the random generation of monotone data sets, Another note on Dilworth's decomposition theorem., Monotonicity as a tool for differentiating between truth and optimality in the aggregation of rankings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• It is hard to know when greedy is good for finding independent sets
• Sorting multi-attribute alternatives: the TOMASO method
• On implementing the push-relabel method for the maximum flow problem
• On the number of vertices belonging to all maximum stable sets of a graph
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting
• Monotonicity preserving approximation of multivariate scattered data
• Growing decision trees in an ordinal setting
• How to build aggregation operators from data
• Stochastic Dominance