A new algorithm for the triangulation of input-output tables in economics

Supply Chain And Finance

Volumn , Issue , 2004, Pages 253-272

  Chiarini, B H ^a   Chaovalitwongse, W ^a   Pardalos, P M ^a  

^a University of Florida   (United States)

Author keywords

Greedy randomized adaptive search procedure (GRASP); Linear ordering problem; Path relinking; Triangulation of input output matrices

Indexed keywords

EID: 85115970361     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/9789812562586_0015     Document Type: Chapter

References (22)

1. G. Bolotashvili, M. Kovalev, and E. Girlich. New facets of the linear ordering polytope. SIAM Journal on Discrete Mathematics, 12(3):326-336, 1999.
2. R.E. Burkard, E. Cela, P.M. Pardalos, and L.S. Pitsoulis. The quadratic assignment problem. In P.M. Pardalos and D.-Z. Du, editors, Handbook of Combinatorial Optimization, pages 241-338. Kluwer Academic Publishers, 1998.
3. Vicente Campos, Fred Glover, Manuel Laguna, and Rafael Martf. An experimental evaluation of a scatter search for the linear ordering problem. Journal of Global Optimization, 21(4):397-414, December 2001.
4. Stefan Chanas and Przemyslaw Kobylahski. A new heuristic algorithm solving the linear ordering problem. Computational Optimization and Applications, 6:191-205, 1996.
5. Hollis B. Chenery and Tsunehiko Watanabe. International comparisons of the structure of production. Econometrica, 26(4):487-521, October 1958.
6. Thomas Christof and Gerhard Reinelt. Low-dimensional linear ordering poly-topes. 1997.
7. George B. Dantzig. Linear programming. Operations Research, 50(1):42-47, January 2002.
8. Thomas A. Feo and Mauricio G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 2:1-27, 1995.
9. Paola Festa, Mauricio G.C. Resende, and Geraldo Veiga. Annotated bibliography of GRASP, http://www.research.att.com/~mgcr/grasp/annotated.
10. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York, USA, 1979.
11. Fred Glover and Manuel Laguna. Tabu Search. Kluwer Academic Publishers, Boston, 1997.
12. Martin Grotschel, Michael Jiinger, and Gerhard Reinelt. A cutting plane algorithm for the linear ordering problem. Operations Research, 2(6): 1195-1220, 1984.
13. Michael Jiinger. Polyhedral Combinatorics and the Acyclic Subdigraph Problem. Number 7 in Research and Exposition in Mathematics. Heldermann Verlag, Berlin, 1985.
14. Manuel Laguna and Rafael Marti. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11(1):44-52, 1998.
15. Manuel Laguna, Rafael Marti, and Vicente Campos. Intensification and diversification with elite tabu search solutions for the linear ordering problem. Computers & Operations Research, 26:1217-1230, 1999.
16. Wassily Leontief. Input-Output Economics. Oxford University Press, New York, USA, 1986.
17. Rafael Marti’. Multi-start methods. In Fred Glover and Gary A. Kochen-berger, editors, Handbook of Metaheuristics, International Series in Operations Research & Management Sciences, chapter 12, pages 355-368. 8, 2003.
18. John E. Mitchell. Computational experience with an interior point cutting plane algorithm. Technical report, Mathematical Sciences, Rensellaer Polytechnic Intitute, Troy, NY 12180-3590, USA., 1997.
19. John E. Mitchell. Generating linear ordering problems, Dec. 2002. http://www.rpi.edu/~mitchj/generators/linord.
20. John E. Mitchell and Brian Borchers. Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm. In H. Frenk et al., editor, High Performance Optimization, chapter 14, pages 345-366. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.
21. Gerhard Reinelt. The linear ordering problem: algorithms and applications. Number 8 in Research and Exposition in Mathematics. Heldermann Verlag, Berlin, 1985.
22. Gerhard Reinelt. Linear ordering library (LOLIB), Dec. 2002. http://www.iwr.uni-heildelberg.de/iwr/comopt/soft/LOLIB/LOLIB.html.