Pages that link to "Item:Q3320125"
From MaRDI portal
The following pages link to A versatile scheme for ranking the extreme points of an assignment polytope (Q3320125):
Displaying 5 items.
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations (Q1169409) (← links)
- A note on a new variant of Murty's ranking assignments algorithm (Q1416101) (← links)
- Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems (Q3346092) (← links)
- Extreme point Quadratic Minimization Problem (Q4272558) (← links)