A bilinear programming formulation of the 3-dimensional assignment problem
From MaRDI portal
Publication:4050393
DOI10.1007/BF01585532zbMath0296.90031OpenAlexW2057609695MaRDI QIDQ4050393
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585532
Related Items
Approximation algorithms for multi-dimensional assignment problems with decomposable costs, An algebra-based approach for linearly constrained concave minimization, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, A note on the solution of bilinear programming problems by reduction to concave minimization, A survey for the quadratic assignment problem, Global minimization of large-scale constrained concave quadratic problems by separable programming, The bilinear assignment problem: complexity and polynomially solvable special cases, A survey of dynamic network flows, Jointly constrained bilinear programs and related problems: An overview, Global optimization for generalized linear multiplicative programming using convex relaxation, Global maximization of a generalized concave multiplicative function, On multi-index assignment polytopes, Approximation algorithms for three-dimensional assignment problems with triangle inequalities, Geometric three-dimensional assignment problems, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm, The three dimensional bottleneck assignment problem and its variants
Cites Work
