MILP formulation and polynomial time algorithm for an aircraft scheduling problem

2004 ◽  
Author(s):  
A.M. Bayen ◽  
C.J. Tomlin ◽  
Yinyu Ye ◽  
Jiawei Zhang
Keyword(s):  
Polynomial Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scheduling Problem ◽  
Aircraft Scheduling

Learning Importance of Preferences

10.29007/v68w ◽  
2018 ◽  
Author(s):  
Ying Zhu ◽  
Mirek Truszczynski
Keyword(s):  
Polynomial Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scoring Rules ◽  
Np Hard ◽  
Individual Preferences

We study the problem of learning the importance of preferences in preference profiles in two important cases: when individual preferences are aggregated by the ranked Pareto rule, and when they are aggregated by positional scoring rules. For the ranked Pareto rule, we provide a polynomial-time algorithm that finds a ranking of preferences such that the ranked profile correctly decides all the examples, whenever such a ranking exists. We also show that the problem to learn a ranking maximizing the number of correctly decided examples (also under the ranked Pareto rule) is NP-hard. We obtain similar results for the case of weighted profiles when positional scoring rules are used for aggregation.

Sign in / Sign up

Export Citation Format

Share Document