Pages that link to "Item:Q4135225"
From MaRDI portal
The following pages link to An algebraic approach to assignment problems (Q4135225):
Displaying 20 items.
- Discrete optimization: an Austrian view (Q537581) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Random assignment problems (Q953417) (← links)
- An out-of-kilter method for the algebraic circulation problem (Q1057166) (← links)
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective (Q1133463) (← links)
- An algorithm for algebraic assignment problems (Q1138479) (← links)
- Duality for algebraic linear programming (Q1142711) (← links)
- Reducibility of minimax to minisum 0-1 programming problems (Q1148229) (← links)
- Optimal cocircuits in regular matroids and applications (Q1164550) (← links)
- An augmenting path method for solving linear bottleneck assignment problems (Q1244171) (← links)
- A general Hungarian method for the algebraic transportation problem (Q1245143) (← links)
- On scheduling multi-processor systems with algebraic objectives (Q1259901) (← links)
- An improved general procedure for lexicographic bottleneck problems (Q1306359) (← links)
- Trapezoidal matrices and the bottleneck assignment problem (Q1805450) (← links)
- OR Utopia (Q1806727) (← links)
- Bottleneck capacity expansion problems with general budget constraints (Q2765595) (← links)
- Duality and admissible transformations in combinatorial optimization (Q3048583) (← links)
- Universal conditions for algebraic travelling salesman problems to be efficiently solvable (Q3360022) (← links)
- Numerical investigations on quadratic assignment problems (Q4173192) (← links)
