Skip to main content
SpringerLink
Log in

On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems

  • Conference paper
Book cover Operations Research Proceedings 2005

Part of the book series: Operations Research Proceedings ((ORP,volume 2005))

Research partially supported by grant NAL/00636/G from the Nuffield Foundation (UK), grants 312125, 314668 and 15296 from the Natural Sciences and Engineering Research Council of Canada, and a Bell University Laboratories Research Grant.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.R.S. Amaral. On the exact solution of a facility layout problem. Eur. J. Oper. Res., to appear.

    Google Scholar 

  2. M.F. Anjos, A. Kennings, and A. Vannelli. A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discr. Opt., 2(2):113–122, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  3. B. Borchers. CSDP, a C library for semidefinite programming. Optim. Methods Softw., 11/12(1–4):613–623, 1999.

    MathSciNet  Google Scholar 

  4. E. de Klerk. Aspects of Semidefinite Programming, volume 65 of Applied Optimization. Kluwer Academic Publishers, Dordrecht, 2002.

    MATH  Google Scholar 

  5. M. Grötschel, M. Jünger, and G. Reinelt. A cutting plane algorithm for the linear ordering problem. Oper. Res., 32(6):1195–1220, 1984.

    MATH  MathSciNet  Google Scholar 

  6. M. Grötschel, M. Jünger, and G. Reinelt. Facets of the linear ordering polytope. Math. Program., 33(1):43–60, 1985.

    Article  MATH  Google Scholar 

  7. C. Helmberg. http://www-user.tu-chemnitz.de/~helmberg/semidef.html.

    Google Scholar 

  8. C. Helmberg and K.C. Kiwiel. A spectral bundle method with bounds. Math. Program., 93(2, Ser. A):173–194, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  9. C. Helmberg and F. Rendl. A spectral bundle method for semidefinite programming. SIAM J. Optim., 10(3):673–696 (electronic), 2000.

    Article  MATH  MathSciNet  Google Scholar 

  10. S.S. Heragu and A. Kusiak. Machine layout problem in flexible manufacturing systems. Oper. Res., 36(2):258–268, 1988.

    Google Scholar 

  11. W. Liu and A. Vannelli. Generating lower bounds for the linear arrangement problem. Discrete Appl. Math., 59(2):137–151, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  12. J.-C. Picard and M. Queyranne. On the one-dimensional space allocation problem. Oper. Res., 29(2):371–391, 1981.

    MATH  MathSciNet  Google Scholar 

  13. G. Reinelt. The linear ordering problem: algorithms and applications, volume 8 of Research and Exposition in Mathematics. Heldermann Verlag, Berlin, 1985.

    Google Scholar 

  14. D.M. Simmons. One-dimensional space allocation: An ordering algorithm. Oper. Res., 17:812–826, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. Solimanpur, P. Vrat, and R. Shankar. An ant algorithm for the single row layout problem in flexible manufacturing systems. Comput. Oper. Res., 32(3):583–598, 2005.

    Article  MATH  Google Scholar 

  16. H. Wolkowicz, R. Saigal, and L. Vandenberghe, editors. Handbook of Semidefinite Programming. Kluwer Academic Publishers, Boston, MA, 2000.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1

    Miguel F. Anjos

  2. Department of Electrical & Computer Engineering, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1

    Anthony Vannelli

Authors
  1. Miguel F. Anjos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anthony Vannelli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Shipping Economics and Logistics Dept. Logistics Systems, University of Bremen, Universitätsallee GW1 Block A, 28359, Bremen, Germany

    Hans-Dietrich Haasis

  2. Faculty of Business Studies and Economics Chair of Logistics, University of Bremen, PO Box 33 04 40, 28334, Bremen, Germany

    Herbert Kopfer  & Jörn Schönberger  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anjos, M.F., Vannelli, A. (2006). On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_44

Download citation

Publish with us

Policies and ethics

Search

Navigation