A bilinear programming formulation of the 3-dimensional assignment problem

DOI10.1007/BF01585532MaRDI QIDQ4050393zbMATH OpenOpenAlexFDO

Authors Alan Frieze

Publication date 1974

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01585532

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• Letter to the Editor—The Multidimensional Assignment Problem

Cited in

(17)

• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• A note on the solution of bilinear programming problems by reduction to concave minimization
• Geometric three-dimensional assignment problems
• Approximation algorithms for multi-dimensional assignment problems with decomposable costs
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• The bilinear assignment problem: complexity and polynomially solvable special cases
• Global optimization for generalized linear multiplicative programming using convex relaxation
• An algebra-based approach for linearly constrained concave minimization
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
• On multi-index assignment polytopes
• The three dimensional bottleneck assignment problem and its variants
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• The independent quadratic assignment problem: complexity and polynomially solvable special cases
• A survey for the quadratic assignment problem
• A survey of dynamic network flows
• Jointly constrained bilinear programs and related problems: An overview
• Global maximization of a generalized concave multiplicative function

This page was built for publication: A bilinear programming formulation of the 3-dimensional assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4050393)