Geometric three-dimensional assignment problems☆
暂无分享,去创建一个
[1] William P. Pierskalla,et al. Letter to the Editor - The Multidimensional Assignment Problem , 1968, Oper. Res..
[2] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[3] Alan M. Frieze,et al. A bilinear programming formulation of the 3-dimensional assignment problem , 1974, Math. Program..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[6] Martin E. Dyer,et al. Planar 3DM is NP-Complete , 1986, J. Algorithms.
[7] Robert E. Tarjan,et al. Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..
[8] Kenneth C. Gilbert,et al. MULTIDIMENSIONAL ASSIGNMENT PROBLEMS , 1988 .
[9] Egon Balas,et al. Facets of the three-index assignment polytope , 1989, Discret. Appl. Math..
[10] Frits C. R. Spieksma,et al. Throughput rate optimization in the automated assembly of printed circuit boards , 1991 .
[11] Egon Balas,et al. An Algorithm for the Three-Index Assignment Problem , 1991, Oper. Res..
[12] Y. Crama,et al. Approximation algorithms for three-dimensional assignment problems with triangle inequalities , 1992 .
[13] W. H. M. Zijm,et al. Production preparation and numerical control in PCB assembly , 1993 .
[14] Aubrey B. Poore,et al. A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking , 1993, SIAM J. Optim..
[15] Gerhard J. Woeginger,et al. Some Geometric Clustering Problems , 1994, Nord. J. Comput..
[16] Peter Brucker,et al. A Monge Property for the D-dimensional Transportation Problem , 1995, Discret. Appl. Math..
[17] Gerhard J. Woeginger,et al. Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients , 1996, Discret. Appl. Math..
[18] Frits C. R. Spieksma,et al. A General Class of Greedily Solvable Linear Programs , 1998, Math. Oper. Res..