A bilinear programming formulation of the 3-dimensional assignment problem-Reference-Cited by-同舟云学术

A bilinear programming formulation of the 3-dimensional assignment problem

Published:1974-12 Issue:1 Volume:7 Page:376-379
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Frieze A. M.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01585532.pdf

Reference4 articles.

1. W.P. Pierskalla, “The multi-dimensional assignment problem”,Operations Research 16 (1968) 422–431.

2. M.M. Shamma, “A general multi-dimensional assignment problem”, Ph.D. Thesis, Technological Institute, CS/OR Center, Southern Methodist University, Dallas, Texas.

3. Hoang Tuy, “Concave programming under linear constraints”,Soviet Mathematics (1964) 1437–1440.

4. M. Vlatch, “Branch and bound method for the three index assignment problem”,Ekonomicko Matematický Obzor 3 (1967).

Cited by 39 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quadratic Assignment Problem;Encyclopedia of Optimization;2024

2. Device-Clustering and Rate-Splitting Enabled Device-to-Device Cooperation Framework in Fog Radio Access Network;IEEE Transactions on Green Communications and Networking;2021-09

3. Global Optimization for Generalized Linear Multiplicative Programming Using Convex Relaxation;Mathematical Problems in Engineering;2018

4. Hybrid Visible Light and Power Line Communication for Indoor Multiuser Downlink;Journal of Optical Communications and Networking;2017-07-24

5. The bilinear assignment problem: complexity and polynomially solvable special cases;Mathematical Programming;2017-01-19