Skip to main content
Log in

Discrete optimization: An Austrian view

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • Albrecher, H., R.E. Burkard, and E. Çela. (2006). “An Asymptotical Study of Combinatorial Optimization by Means of Statistical Mechanics.” Journal of Computational and Applied Mathematics, 186, 148–162.

    Article  Google Scholar 

  • Burkard, R.E. (1972). Methoden der Ganzzahligen Optimierung. Wien-New York: Springer Publisher.

    Google Scholar 

  • Burkard, R.E., V.G. Deıneko, R. van Dal, J. van der Veen, and G.J. Woeginger. (1998). “Well-Solvable Special Cases of the TSP: A Survey.” SIAM Review, 40, 496–546.

  • Burkard, R.E. and U. Derigs. (1980). Assignment and Matching Problems: Solution Methods with FORTRAN- Programs. Lecture Notes in Economics and Mathematical Systems, vol. 184. Berlin-New York: Springer.

  • Burkard, R.E. and U. Fincke. (1985). “Probabilistic Asymptotic Properties of Some Combinatorial Optimization Problems.” Discrete Applied Mathematics, 12, 21–29.

    Article  Google Scholar 

  • Burkard, R.E., W. Hahn, and U. Zimmermann. (1977). “An Algebraic Approach to Assignment Problems.” Mathematcis Programming, 12, 318–327.

    Article  Google Scholar 

  • Burkard, R.E., B. Klinz, and R. Rudolf. (1996). “Perspectives of Monge Properties in Optimization.” Discrete Applied Mathematics, 70, 95–161.

    Article  Google Scholar 

  • Burkard, R.E. and J. Krarup. (1998). “A Linear Algorithm for the Pos/Neg-Weighted 1-Median Problem on a Cactus.” Computing, 60, 193–215.

    Google Scholar 

  • Burkard, R.E. and J. Offermann. (1977). “Entwurf von Schreibmaschinentastaturen Mittels Quadratischer ZuordnungsProbleme.” Zeitschrift für Operations Research, 21, B121–B132.

    Article  Google Scholar 

  • Burkard, R.E., C. Pleschiutschnig, and J. Zhang. (2004). “Inverse p-Median Problems.” Discrete Optimization, 1, 23–39.

    Article  Google Scholar 

  • Burkard, R.E. and F. Rendl. (1984). “A Thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems.” European Journal of Operational Research, 17, 169–174.

    Article  Google Scholar 

  • Burkard, R.E. and U. Zimmermann. (1982). “Combinatorial Optimization in Linearly Ordered Semimodules: A Survey.” In B. Korte (Ed.), Modern Applied Mathematics. North Holland, Amsterdam, pp. 392–436.

  • Finke, G., R.E. Burkard, and F. Rendl. (1987). “Quadratic Assignment Problems.” Annals of Discrete Mathematics, 31, 61–82.

    Google Scholar 

  • Goemans, M. and F. Rendl. (2000). Combinatorial Optimization. Handbook of Semidefinite Programming, International Series in Operations Research & Management Science, vol. 27, pp. 343–360. Boston, MA: Kluwer Acad. Publ.

    Google Scholar 

  • Hoffman, A.J. (1963). “On Simple Linear Programming Problems.” In V. Klee (ed.), Proceedings of Symposia in Pure Mathematics. Convexity, vol. VII. AMS, Providence, RI, pp. 317–327.

  • Park, J.K. (1991). “A Special Case of the n-Vertex Traveling Salesman Problem that can be Solved in O(n) Time.” Information Processing Letters, 40, 247–254.

    Article  Google Scholar 

  • Zimmermann, U. (1981). “Linear and Combinatorial Optimization in Ordered Algebraic Structures.” Annals of Discrete Mathematics, 10.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rainer E. Burkard.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burkard, R.E. Discrete optimization: An Austrian view. Ann Oper Res 149, 43–48 (2007). https://doi.org/10.1007/s10479-006-0089-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-006-0089-5

Keywords

Navigation