Models and methods for standardization problems

European Journal of Operational Research

Volumn 162, Issue 3, 2005, Pages 713-726

  Domschke, Wolfgang ^a   Wagner, Bernd ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Combinatorial optimization; Discrete optimization; Network flows; Quadratic programming; Standardization

Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; INFORMATION ANALYSIS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; QUADRATIC PROGRAMMING; STANDARDIZATION;

COMBINATORIAL OPTIMIZATION; DISCRETE OPTIMIZATION; NETWORK FLOWS;

PROBLEM SOLVING;

EID: 9544245814     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.10.023     Document Type: Article

References (16)

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., 1993. Network flows-Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, NJ.
2. Allemand, K., Fukuda, K., Liebling, T.M., Steiner, E., 2001. A polynomial case of unconstrained zero-one quadratic optimization. Mathematical Programming, Series A 91, 49-52.
3. Betz, M., 2001. Exakte Lösungsverfahren für Standardisierungsprobleme. Master's thesis, Department of Business Administration, Economics and Law, Darmstadt University of Technology.
4. Buxmann, P., 1996. Standardisierung betrieblicher Informationssysteme. Deutscher Universitäts-Verlag, Wiesbaden.
5. Buxmann, P., Weitzel, T., Westarp, F.v., König, W., 1999. The standardization problem - An economic analysis of standards in information systems. In: 1st IEEE Conference on Standardisation and Innovation in Information Technology SIIT '99, 1999, pp. 157-162 (see also: http://www.wi-frankfurt.de/projectb3/eng/publikat/files1/problem.pdf).
6. Cherkassky, B.V., Goldberg, A.V., 1997. On implementing push-relabel method for the maximum flow problem. Algorithmica 19, 390-410.
7. Cornuéjols, G., Nemhauser, G.L., Wolsey, L.A., 1990. The uncapacitated facility location problem. In: Mirchandani, P.B., Francis, R.L. (Eds.), Discrete Location Theory. Wiley, New York, pp. 119-171.
8. Domschke, W., 1995. Logistik: Transport, fourth ed. Oldenbourg, München-Wien.
9. Domschke, W., Krispin, G., 1997. Location and layout planning: A survey. OR Spektrum 19, 181-194.
10. Domschke, W., Mayer, G., Wagner, B., 2002. Effiziente Modellierung von Entscheidungsproblemen: Das Beispiel des Standardisierungsproblems. Zeitschrift für Betriebswirtschaft 72, 847-863.
11. Garey, M.R., Johnson, D.S., 1979. Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco.
12. Heller, I., Tompkins, C.B., 1956. An extension of a theorem of Dantzig's. In: Kuhn, H.W., Tucker, A.W. (Eds.), Linear Inequalities and Related Systems. Princeton University Press, Princeton, NJ, pp. 247-254.
13. Kimms, A., 2003. Costing communication standards in information systems. Journal of the Operational Research Society 54, 426-431.
14. Picard, J.C., Ratliff, H.D., 1975. Minimum cuts and related problems. Networks 5, 357-370.
15. Williams, H.P., 1999. Model Building in Mathematical Programming, fourth ed. Wiley, Chichester.
16. Winston, W.L., 1994. Operations Research - Applications and Algorithms, third ed. Duxbury Press, Belmont.