Pages that link to "Item:Q835811"
From MaRDI portal
The following pages link to Computing leximin-optimal solutions in constraint networks (Q835811):
Displaying 15 items.
- Filtering algorithms for the multiset ordering constraint (Q835808) (← links)
- Computing leximin-optimal solutions in constraint networks (Q835811) (← links)
- On the analytic representation of the Leximin ordering and its application to flexible constraint propagation (Q1291589) (← links)
- Studies of lexicography in the generalized network simplex method (Q1312763) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach (Q2122769) (← links)
- Lexicographically-ordered constraint satisfaction problems (Q2267804) (← links)
- A lexicographic minimax approach to the vehicle routing problem with route balancing (Q2282498) (← links)
- Constrained global optimization for wine blending (Q2398517) (← links)
- Leximax minimum solution of addition-min fuzzy relation inequalities (Q2663562) (← links)
- (Q3441018) (← links)
- (Q3493317) (← links)
- A lexicographic maximin approach to the selective assessment routing problem (Q6103191) (← links)
- Collective decision making (Q6602233) (← links)
- Resolution of the sec-max-product fuzzy relation inequalities system and its lexicographic minimum solution (Q6623479) (← links)