Einführung in das Operations Research
Gabler Studientexte (Betriebswirtschafts-Akademie), Wiesbaden, Gabler, 1980
(with A. Bachem)
Input-Output-Analyse bei unternehmensgrößenspezifischen Fragestellungen
Institut für Mittelstandsforschung, Bonn, 1981
(with A. Bachem, L. Butz und M. Grötschel)
Greedoids
Springer Verlag 1991, Heidelberg
(with B. Korte und L. Lovász)
Operations Research 93
Springer Verlag, Heidelberg
(with A. Bachem, U. Derigs und M. Jünger)
Mathematik in der Praxis - Fallstudien aus Industrie, Wirtschaft, Naturwissenschaft und Medizin
Springer Verlag 1995, Heidelberg
(with A. Bachem und M. Jünger)
A duality theorem and minimal inequalities in mixed integer programming
Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) 59, 1979, 88-89
(with A. Bachem)
Minimal inequalities and subadditive duality
SIAM Journal on Control and Optimization 18, 1980, 437-443
(with A. Bachem)
A note on approximation algorithms for graph partitioning problems
Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) 62, 1982, 384-386
A characterization of minimal inequalities for mixed integer programs
Operations Research Letters 1, 1982, 63-66
(with A. Bachem and Ellis L. Johnson)
The ellipsoid method and its applications
OR Spektrum 5, 1983, 1-13
Approximations to partitioning and subgraph problems on trees
Discrete Applied Mathematics 6, 1983, 301-309
A note on W-optimal assignable sets
Bolletino di Unione Matematica Italiana (6), 3-A, 1984, 97-101
(with U. Derigs)
Minimizing completion time for a class of scheduling problems
Information Processing Letters 19, 1984, 27-29
(with U. Faigle)
Algorithmic approaches to setup minimization
SIAM Journal on Computing 14, 1985, 954-965
(with U. Faigle und G. Gierz)
A setup heuristic for interval orders
Operations Research Letters 4, 1985, 185-188
(with U. Faigle)
A combinatorial bijection between linear extensions of equivalent orders
Discrete Mathematics 58, 1986, 295-301
(with U. Faigle)
Greene-Kleitman extension of ordered sets
Methods of Operations Research 53, 1986, 251-255
(with U. Faigle)
On the computational complexity of the order polynomial
Discrete Applied Mathematics 15, 1986, 261-269
(with U. Faigle)
Searching in trees, series-parallel and interval orders
SIAM Journal on Computing 15, 1986, 2075-2084
(with U. Faigle, L. Lovász and Gy. Turán)
Monge sequences and a simple assignment algorithm
Discrete Applied Mathematics 15, 1986, 241-248
(with U. Derigs und O. Goecke)
Interval orders without odd crowns are defect optimal
Computing 38, 1987, 59-69
(with U. Faigle)
A cutting plane algorithm for optimal graph partitioning
Methods of Operations Research 57, 1987, 109-116
(with U. Faigle und R. Suletzki)
Setup optimization problems in matroid structures
ORDER 4, 1987, 43-54
(with U. Faigle)
On the convergence of stationary dirstributions in simulated annealing algorithms
Information Processing Letters 27, 1988, 189-194
(with U. Faigle)
Simulated annealing - Eine Fallstudie
Angewandte Informatik 6, 1988, 259-263
(with U. Faigle)
Minor characterization of undirected branching greedoids - a short proof
Discrete Mathematics 82, 1990, 93-99
(with O. Goecke)
Graphs and Orders
Computing Suppl., 1990, 109-124
(with U. Faigle)
The permutahedron of series-parallel posets
Discrete Applied Mathematics 28, 1990, 3-9
(with A.v. Arnim und U. Faigle)
A greedy reduction algorithm for setup optimization
Discrete Applied Mathematics 35, 1992, 73-79
(with U. Faigle)
The communication complexity of interval orders
Discrete Applied Mathematics 40, 1992, 19-28
(with U. Faigle und Gy. Turán)
The permutahedron of P4-sparse posets
Mathematical Programming 75 (1996), 179-192
(with A.v. Arnim und Y. Wang)
The setup polyhedron of series-parallel posets
Discrete Applied Mathematics 79, 1997, 213-221
(with G. Wambach)
Base polytopes of series-parallel posets: linear description and optimization
Mathematical Programming 82, 1998, 159-173
(with A. Schulz und G. Wambach)
The setup polytope of N-sparse posets
Annals of Operations Research 92 (1999), 125-142
(with G. Wambach)
A note on the finite time behavior of simulated annealing
Mathematics of Operations Research 25 (2000), 476-484
(with A. Nolte)
Simulated annealing and Graph Colouring
Combinatorics, Probability and Computing 10 (2001), 29-40
(with A. Nolte)
Clustering Protein Sequences - Structure Prediction by transitive
homology
Bioinformatics 17 (2001), 935-941
(with E. Bolten, A. Schliep, S. Schneckener und D. Schomburg)
Modeling and solving an airline schedule generation problem
Annals of Operations Research 107 (2001), 117-142
(with A. Erdmann, A. Nolte und A. Noltemeier)
Strongly Connected Components can Predict Protein Structure
Electronic Notes in Discrete Mathematics 8 (2001), 10-13
(mit E. Bolten, A. Schliep, S. Schneckener und D. Schomburg)
Calculation of street traffic emissions with a queuing model
Journal of Computational Technologies 7 (2002), 5-15
(with N. Eissfeldt)
ProClust: Improved clustering of protein sequences with an extended graph-based approach
Bioinformatics 18 (2002), S182-S192
(with P. Pipenbacher, A. Schliep, S. Schneckener, A. Schönhuth und
D. Schomburg)
Fast and robust registration of PET and MR images of human brain
NeuroImage 22 (2004), 434-442
(with J. Cizek, K. Herholz, St. Vollmar, J. Klein und W.-D. Heiss)
Metabolic pathway analysis web service (Pathway Hunter Tool at
CUBIC)
Bioinformatics 21 (2005), 1189-1193
(with S. A. Rahman, P. Advani, Dietmar Schomburg und R. Schunk)
A fractional programming approach to efficient DNA melting
temperature calculation
Bioinformatics 21 (2005), 2375-2382
(with M. Leber, L. Kaderali, A. Schönhuth)
Metabolic network analysis: implication and application
BMC Bioinformatics 6 (Suppl. 3) S12 (2005)
(with S. A. Rahman, P. S. Jonnalagadda, J. Padiadpu, K. Hartmann und D.
Schomburg)
CASPAR: a hierarchical bayesian approach to predict survival times in
cancer from gene expression data
Bioinformatics 22 (2006), 1495-1502
(with L. Kaderali, T. Zander, U. Faigle, J. Wolf, J.L. Schultze)
Modeling feedback loops in the H-NS-mediated regulation of the Escherichia
coli bgl operon
Journal of Theoretical Biology 250 (2007), 298-306
(with N. Radde, J. Gebert, U. Faigle und K. Schnetz)
Cologne/Twente Workshop on Graphs and Combinatorial Optimization 2005
Discrete Applied Mathematics 156 (2008)
(with U. Faigle, B. Randerath (Eds.))
Zusammenarbeit zwischen Universität und Kreditinstitut bei der
Bankensteuerung
Zeitschrift für das gesamte Kreditwesen 61 (2008), 1024-1027
(with F. Miehe)
Identifying genes of gene regulatory networks using formal concept analysis
Journal of Computational Biology 15 (2008), 185-194
(with J. Gebert, S. Motameny, U. Faigle, C. V. Forst)
Semi-preemptive routing on trees
Discrete Applied Mathematics 156 (2008), 3298-3304
(with S. O. Krumke, D. Räbiger)
Semi-preemptive routing on a linear and circular track
Discrete Optimization 6 (2009), 223-230
(with D. Räbiger)
Small Molecule Subgraph Detector (SMSD) toolkit
Journal of Cheminformatics 1 (2009), 1-12
(with S. A. Rahman, M. Bashton, G. L. Holliday, J. M. Thornton)
Distance-hereditary digraphs
Journal of Discrete Algorithms 8 (2010), 231-240
(with M. Lätsch)
The complexity of connected dominating sets and total dominating sets with specified induced graphs
Information Processing Letters 112 (2012), 953-957
(with O. Schaudt)
Cologne/Twente Workshop on Graphs and Combinatorial Optimization 2010
Discrete Applied Mathematics 161 (2013)
(with U. Faigle (Eds.))
On the separability of graphs
Discrete Mathematics 313 (2013), 809-820
(with O. Schaudt and V. Weil)
Freight car dispatching with generalized flows
Networks 66 (2015), 33-39
(with B. Engels)
On the non-unit count of interval graphs
Discrete Applied Mathematics 195 (2015), 2-7
(with A. Apke)
Cologne/Twente Workshop on Graphs and Combinatorial Optimization 2017
Discrete Applied Mathematics 272 (2020)
(with B. Randerath, H. Röglin, B. Peis, O. Schaudt, F. Vallentin (Eds.))
A de Bruijn-Erdös Theorem for (q,q-4)-graphs
Discrete Applied Mathematics 279 (2020), 198 - 201
(with L. Stenmans)
Cross-series-parallel digraphs
Discrete Applied Mathematics 303 (2021), 57 - 65
(with J. Dornemann)
A characterization of interval orders with semiorder dimension two
Discrete Applied Mathematics 297 (2021), 142 - 150
(with A. Apke)
A note on integral generalized flows in directed partial 2-trees
Information Processing Letters 172 (2021), 106147
(wih A. Billstein)
A note on convergence proof for Shor-Khachian methods
in: A. Auslender, W. Oettli, J. Stoer (eds.) Optimization and Optimal Control,
Lecture Notes in Control and Information Sciences 30, 51-57,
Berlin-Heidelberg-New York, Springer-Verlag, 1981
(with B. Korte)
On the existence of fast approximation schemes
in: O.L. Magasarian, R.R. Meyer, S.M. Robinson (eds.):
Nonlinear Programming 4,
415-437, New York-San Francisco-London, Academic Press, 1981
(with B. Korte)
Ellipsoid methods
in: B.Korte (ed.)
Modern Applied Mathematics: Optimization and Operations Research
265-311,
Amsterdam-New York-Oxford, North Holland, 1982
A survey on oracle techniques
in: J. Gruska, M. Chytil (eds.): Mathematical Foundations of Computer Science 1981,
Lecture Notes in Computer Science 118, 61-77, Springer Verlag 1981
(with B. Korte)
Can the ellipsoid method be efficient?
in: H. Hauptmann, W. Krelle, K.C. Mosler (eds.):
Operations Research and Economic Theory,
Springer Verlag, 1984, 337-343
(with B. Korte)
Zur Maschinenbelegungsplanung unter TNI-geordneten Restriktionen
in: H. Steckhan et.al. (eds.): Operations Research Proceedings 1983,
Springer-Verlag, 1984, 279-281
(with U. Faigle)
Comparability graphs and order invariants
in: U. Pape (ed.) Graphtheoretic Concepts in Computer Science
Trauner Verlag, Linz, 1985, 136-145
(with U. Faigle)
Bisimplical edges, Gaussian elimination and matchings
in: U. Pape (ed.) Graphtheoretic Concepts in Computer Science,
Trauner Verlag, Linz, 1985, 79-87
(with U. Derigs und O. Goecke)
Search problems in ordered sets
in: D. Ohlse et al. (eds.): Operations Research Proceedings 1984,
Springer Verlag, 1985, 411-415
(with U. Faigle, L. Lovász und Gy. Turán)
Minimization techniques for comparability graphs
in: H. Noltemeier (ed.): Graphtheoretic Concepts in Computer Science,
Trauner Verlag, Linz, 1985, 101-122
(with U. Faigle)
Mathematische Modelle für Bausparkollektive
in: B. Rudolph and J. Wilhelm (eds.): Bankpolitik, finanzielle Unternehmensführung
und die Theorie der Finanzmärkte,
Duncker und Humblot, Berlin, 1988
(with A. Bachem und B. Korte)
Simulated annealing and its problems to color graphs
Proceedings of the European Symposium on Algorithms,
Lecture Notes in Computer Science 1136, 138-152, Springer Verlag
(with A. Nolte)
Parallele Algorithmen für Routing-Probleme im Flug- und Straßenverkehr
HSPC 95, Statustagung des BMBF, 1995, 149-162
(with B. Monien et al.)
A note on the finite time behavior of simulated annealing
in: U. Zimmermann et al. (eds.): Operations Research Proceedings 1996, 175-180,
Springer Verlag
(with A. Nolte)
Parallele Verfahren zur Wegeoptimierung in der Flugplanung und Logistik
HSPC 97, Statustagung des BMBF, 1997, 181-196
(with B. Monien et al.)
Analyse grosser Datenmengen und Clusteralgorithmen im Bausparwesen
in: C. Hipp, W. Eichhorn, W.-R. Heilmann: Beiträge zum
7. Symposium
Geld, Finanzwirtschaft, Banken und Versicherungen
(with A. Bachem, S. Fekete, B. Knab, I. Vannahme, I. Weber, R. Wegener,
K. Weinbrecht und B. Wichern)
Some New Approaches to the Microscopic Modelling of Traffic Flow and the Dynamic Route Assignment Problem
in: W. Brilon, F. Huber, M. Schreckenberg, H. Wallentowitz (Eds.) "Traffic and Mobility",
Springer Verlag, S. 149-162, (1999)
(with R. Böning, G. Eisenbeiß, C. Gawron, S. Krauß und P. Wagner)
Investigation of emission reduction strategies with a nested model system
Proceedings of the 11th International Symposium Transport and Air Pollution,2002
(with F.-N. Sentuc, N. Eissfeldt, M. Luberichs, M. Kerschgens und A. Ebel)
Coloring in sublinear time
Proceedings of the European Symposium on Algorithms
Lecture Notes in Computer Science 1284, 388-401, Springer Verlag
(with A. Nolte)
Investigating the impact of traffic emission structures on urban air pollution
with a nested model system
Proceedings of the 4th Symposium on the Urban Environment (2002)
(with F.-N. Sentuc, N. Eissfeldt, M. Luberichs, M. Kerschgens und A. Ebel)
Investigating the impact of changes in traffic emission structures on urban air pollution
with a nested model system
Proceedings of the 5th Symposium on the Urban Environment (2004)
(with F.-N. Sentuc, N. Eissfeldt und M. Kerschgens)
Ein verbandstheoretisches Modell zu Kreditausfallwahrscheinlichkeiten
Immobilien und Finanzierung 07 (2008), 257-259
(with P. Fakler)
Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2
Proceedings of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 239-243
(with B. Engels, S. O. Krumke and C. Zeck)
Sentiment polarity classification using statistical data compression models
Proceedings of the IEEE 12th International Conference on Data Mining Workshops (2012), 731-738
(with D. Ziegelmayer)
A graph-theoretic approach to the train marshalling problem
M. Ganzha et al. (eds): Proceedings of the FedCSIS 11th International Workshop on Computational Optimization (2018), 227-231
(with J. Dörpinghaus)
Solving sorting of rolling stock problems utilizing pseudochain structures in graphs
S. Fidanova (ed.): Recent Advances in Computational Optimization, Studies in Computational Intelligence, Spinger (2020), 45-59
(with J. Dörpinghaus)