Pages that link to "Item:Q4050393"
From MaRDI portal
The following pages link to A bilinear programming formulation of the 3-dimensional assignment problem (Q4050393):
Displayed 16 items.
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities (Q139206) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
- Geometric three-dimensional assignment problems (Q1278259) (← links)
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs (Q1327216) (← links)
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- An algebra-based approach for linearly constrained concave minimization (Q1876470) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
- The three dimensional bottleneck assignment problem and its variants (Q3690581) (← links)
- Global minimization of large-scale constrained concave quadratic problems by separable programming (Q3731373) (← links)