default search action
Rainer E. Burkard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2014
- [j96]Roswitha Rissner
, Rainer E. Burkard:
Bounds on the radius and status of graphs. Networks 64(2): 76-83 (2014) - 2013
- [j95]Behrooz Alizadeh
A linear time algorithm for inverse obnoxious center location problems on networks. Central Eur. J. Oper. Res. 21(3): 585-594 (2013) - 2011
- [j94]Behrooz Alizadeh
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees. Discret. Appl. Math. 159(8): 706-716 (2011) - [j93]Rainer E. Burkard, Roswitha Rissner
Polynomially solvable special cases of the quadratic bottleneck assignment problem. J. Comb. Optim. 22(4): 845-856 (2011) - [j92]Fahimeh Baroughi Bonab
Inverse p-median problems with variable edge lengths. Math. Methods Oper. Res. 73(2): 263-280 (2011) - [j91]Behrooz Alizadeh
Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. Networks 58(3): 190-200 (2011) - 2010
- [j90]Fahimeh Baroughi Bonab
Inverse median location problems with variable coordinates. Central Eur. J. Oper. Res. 18(3): 365-381 (2010) - [j89]Rainer E. Burkard, Behrooz Alizadeh
Inverse center location problems. Electron. Notes Discret. Math. 36: 105-110 (2010) - [j88]Rainer E. Burkard, Mohammadreza Galavii, Elisabeth Gassner:
The inverse Fermat-Weber problem. Eur. J. Oper. Res. 206(1): 11-17 (2010) - [j87]Rainer E. Burkard, Johannes Hatzl:
Median problems with positive and negative weights on cycles and cacti. J. Comb. Optim. 20(1): 27-46 (2010)
2000 – 2009
- 2009
- [b1]Rainer E. Burkard, Mauro Dell'Amico, Silvano Martello:
Assignment Problems. SIAM 2009, ISBN 978-0-89871-663-4, pp. I-XX, 1-382 - [j86]Behrooz Alizadeh
Inverse 1-center location problems with edge length augmentation on trees. Computing 86(4): 331-343 (2009) - [r1]Rainer E. Burkard:
Communication Network Assignment Problem. Encyclopedia of Optimization 2009: 394-396 - 2008
- [j85]Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl:
Reverse 2-median problem on trees. Discret. Appl. Math. 156(11): 1963-1976 (2008) - [j84]Rainer E. Burkard, Carmen Pleschiutschnig, Jianzhong Zhang:
The inverse 1-median problem on a cycle. Discret. Optim. 5(2): 242-253 (2008) - 2007
- [j83]Rainer E. Burkard:
Discrete optimization: An Austrian view. Ann. Oper. Res. 149(1): 43-48 (2007) - [j82]Rainer E. Burkard:
Monge properties, discrete convexity and applications. Eur. J. Oper. Res. 176(1): 1-14 (2007) - [j81]Rainer E. Burkard, Jafar Fathali
A polynomial method for the pos/neg weighted 3-median problem on a tree. Math. Methods Oper. Res. 65(2): 229-238 (2007) - [j80]Rainer E. Burkard, Jafar Fathali
The p-maxian problem on a tree. Oper. Res. Lett. 35(3): 331-335 (2007) - 2006
- [j79]Jafar Fathali
An ant colony algorithm for the pos/neg weighted p-median problem. Central Eur. J. Oper. Res. 14(3): 229-246 (2006) - [j78]Rainer E. Burkard, Johannes Hatzl:
A complex time based construction heuristic for batch scheduling problems in the chemical industry. Eur. J. Oper. Res. 174(2): 1162-1183 (2006) - [j77]Guangting Chen, Gu Zhang, Rainer E. Burkard:
The web proxy location problem in general tree of rings networks. J. Comb. Optim. 12(4): 327-336 (2006) - [j76]Rainer E. Burkard, Elisabeth Gassner, Johannes Hatzl:
A linear time algorithm for the reverse 1-median problem on a cycle. Networks 48(1): 16-23 (2006) - 2005
- [j75]Rainer E. Burkard, Johannes Hatzl:
Review, extensions and computational comparison of MILP formulations for scheduling of batch processes. Comput. Chem. Eng. 29(8): 1752-1769 (2005) - [j74]Rainer E. Burkard:
Preface. Math. Methods Oper. Res. 62(1): 1-2 (2005) - 2004
- [j73]Rainer E. Burkard, Carmen Pleschiutschnig, Jianzhong Zhang:
Inverse median problems. Discret. Optim. 1(1): 23-39 (2004) - [j72]Rainer E. Burkard, Yixun Lin, Jianzhong Zhang:
Weight reduction problems with certain bottleneck objectives. Eur. J. Oper. Res. 153(1): 191-199 (2004) - [j71]Rainer E. Burkard, Vladimir G. Deineko:
On the Euclidean TSP with a permuted Van der Veen matrix. Inf. Process. Lett. 91(6): 259-262 (2004) - 2003
- [j70]Rainer E. Burkard, Peter Butkovic
Finding all essential terms of a characteristic maxpolynomial. Discret. Appl. Math. 130(3): 367-380 (2003) - [j69]Rainer E. Burkard, Helidon Dollani:
Center problems with pos/neg weights on trees. Eur. J. Oper. Res. 145(3): 483-495 (2003) - [j68]Rainer E. Burkard, Peter Butkovic
Max algebra and the linear assignment problem. Math. Program. 98(1-3): 415-429 (2003) - [j67]Guangting Chen, Rainer E. Burkard:
Constrained Steiner trees in Halin graphs. RAIRO Oper. Res. 37(3): 179-194 (2003) - 2002
- [j66]Rainer E. Burkard, Helidon Dollani:
A Note on the Robust 1-Center Problem on Trees. Ann. Oper. Res. 110(1-4): 69-82 (2002) - [j65]Rainer E. Burkard:
Selected topics on assignment problems. Discret. Appl. Math. 123(1-3): 257-302 (2002) - 2001
- [j64]Henrik Blank, Rainer E. Burkard, Gautam Mitra, Toshihide Ibaraki, Steven D. Noble, William R. Pulleyblank:
Preface. Ann. Oper. Res. 107(1-4): 13 (2001) - [j63]Rainer E. Burkard, Helidon Dollani, Phan Thien Thach:
Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks. J. Glob. Optim. 19(2): 121-139 (2001) - [j62]Rainer E. Burkard, Helidon Dollani:
Robust location problems with pos/neg weights on a tree. Networks 38(2): 102-113 (2001) - [j61]Rainer E. Burkard, Bettina Klinz, Jianzhong Zhang:
Bottleneck Capacity Expansion Problems with General Budget Constraints. RAIRO Oper. Res. 35(1): 1-20 (2001) - [j60]Rainer E. Burkard, Helidon Dollani, Yixun Lin, Günter Rote:
The Obnoxious Center Problem on a Tree. SIAM J. Discret. Math. 14(4): 498-509 (2001) - 2000
- [j59]Rainer E. Burkard, Eranda Çela, Helidon Dollani:
2-Medians in trees with pos/neg weights. Discret. Appl. Math. 105(1-3): 51-71 (2000) - [j58]Rainer E. Burkard, Martine Labbé, M. Teresa Ramos, Joaquin Sicilia:
Recent advances in theory and practice of combinatorial optimization (ECCO X). Eur. J. Oper. Res. 123(2): 227-228 (2000)
1990 – 1999
- 1999
- [j57]Rainer E. Burkard, M. M. Miatselski:
Volume Maximization and Orthoconvex Approximation of Orthogons. Computing 63(4): 317-330 (1999) - [j56]Rainer E. Burkard:
OR Utopia. Eur. J. Oper. Res. 119(2): 224-234 (1999) - [j55]Steffen G. Meusel, Rainer E. Burkard:
A transportation problem with a permuted demand vector. Math. Methods Oper. Res. 50(1): 1-7 (1999) - [j54]Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
Erratum: The Travelling Salesman and the PQ-Tree. Math. Oper. Res. 24(1): 262-272 (1999) - [j53]Rainer E. Burkard, Karin Feldbacher, Bettina Klinz, Gerhard J. Woeginger:
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. Networks 33(1): 57-70 (1999) - [p1]Rainer E. Burkard, Eranda Çela:
Linear Assignment Problems and Extensions. Handbook of Combinatorial Optimization 1999: 75-149 - [e2]Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger:
Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings. Lecture Notes in Computer Science 1610, Springer 1999, ISBN 3-540-66019-4 [contents] - 1998
- [j52]Rainer E. Burkard, Toshihide Ibaraki, William R. Pulleyblank:
Preface: Mathematics of Industrial Systems III. Ann. Oper. Res. 76: 0 (1998) - [j51]Rainer E. Burkard, Jakob Krarup:
A Linear Algorithm for the Pos/Neg-Weighted 1-Median Problem on a Cactus. Computing 60(3): 193-216 (1998) - [j50]Rainer E. Burkard, Y. He, Hans Kellerer:
A Linear Compound Algorithm for Uniform Machine Scheduling. Computing 61(1): 1-10 (1998) - [j49]Rainer E. Burkard, Y. He:
A Note on MULTIFIT Scheduling for Uniform Machines. Computing 61(3): 277-283 (1998) - [j48]Rainer E. Burkard, Vladimir G. Deineko:
On the Traveling Salesman Problem with a Relaxed Monge Matrix. Inf. Process. Lett. 67(5): 231-237 (1998) - [j47]Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
The Travelling Salesman Problem on Permuted Monge Matrices. J. Comb. Optim. 2(4): 333-350 (1998) - [j46]Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
The Travelling Salesman and the PQ-Tree. Math. Oper. Res. 23(3): 613-623 (1998) - [j45]Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger:
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases. Math. Program. 82: 125-158 (1998) - [j44]Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van der Veen, Gerhard J. Woeginger:
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey. SIAM Rev. 40(3): 496-546 (1998) - [c4]Rainer E. Burkard:
Assignment Problems. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 49-62 - 1997
- [j43]Rainer E. Burkard, Guochuan Zhang:
Bounded Space On-Line Variable-Sized Bin Packing. Acta Cybern. 13(1): 63-76 (1997) - [j42]Rainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne:
Preface. Ann. Oper. Res. 69: 0 (1997) - [j41]Qi Fan Yang, Rainer E. Burkard, Eranda Çela, Gerhard J. Woeginger:
Hamiltonian cycles in circulant digraphs with two stripes. Discret. Math. 176(1-3): 233-254 (1997) - [j40]Rainer E. Burkard, Stefan E. Karisch, Franz Rendl:
QAPLIB - A Quadratic Assignment Problem Library. J. Glob. Optim. 10(4): 391-403 (1997) - [j39]Rainer E. Burkard:
Efficiently solvable special cases of hard combinatorial optimization problems. Math. Program. 79: 55-69 (1997) - [e1]Rainer E. Burkard, Gerhard J. Woeginger:
Algorithms - ESA '97, 5th Annual European Symposium, Graz, Austria, September 15-17, 1997, Proceedings. Lecture Notes in Computer Science 1284, Springer 1997, ISBN 3-540-63397-9 [contents] - 1996
- [j38]Rainer E. Burkard, Tibor Dudás:
Steiner Minimum Trees for Equidistant Points on Two Sides of an Angle. Acta Cybern. 12(3): 313-324 (1996) - [j37]Rainer E. Burkard, Rüdiger Rudolf, Gerhard J. Woeginger:
Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients. Discret. Appl. Math. 65(1-3): 123-139 (1996) - [j36]Rainer E. Burkard, Bettina Klinz
Perspectives of Monge Properties in Optimization. Discret. Appl. Math. 70(2): 95-161 (1996) - [j35]Rainer E. Burkard, Tibor Dudás, Thomas Maier:
Cut and patch Steiner trees for ladders. Discret. Math. 161(1-3): 53-61 (1996) - [j34]Rainer E. Burkard:
Book review. J. Glob. Optim. 8(1): 105-106 (1996) - [c3]Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger:
The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases. IPCO 1996: 204-218 - [c2]Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
The Travelling Salesman and the PQ-Tree. IPCO 1996: 490-504 - 1995
- [j33]Rainer E. Burkard, Bernd Fruhwirth, Günter Rote:
Vehicle routing in an automated warehouse: Analysis and optimization. Ann. Oper. Res. 57(1): 29-44 (1995) - [j32]Rainer E. Burkard, Toshihide Ibaraki, Maurice Queyranne:
Preface. Ann. Oper. Res. 57(1) (1995) - [j31]Rainer E. Burkard, Vladimir G. Deineko:
Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood. Computing 54(3): 191-212 (1995) - [j30]Rainer E. Burkard:
On the role of bottleneck Monge matrices in combinatorial optimization. Oper. Res. Lett. 17(2): 53-56 (1995) - 1993
- [j29]Rainer E. Burkard, En-Yu Yao:
Erratum: Constrained Partitioning Problems. Discret. Appl. Math. 46(2): 185 (1993) - [j28]Rainer E. Burkard, Karin Dlaska, Bettina Klinz:
The quickest flow problem. ZOR Methods Model. Oper. Res. 37(1): 31-58 (1993) - [c1]Rainer E. Burkard, Eranda Çela, Bettina Klinz:
On the Biquadratic Assignment Problem. Quadratic Assignment and Related Problems 1993: 117-146 - 1991
- [j27]Rainer E. Burkard, W. Sandholzer:
Efficiently solvable special cases of bottleneck travelling salesman problems. Discret. Appl. Math. 32(1): 61-76 (1991) - [j26]Phan Thien Thach, Rainer E. Burkard, Werner Oettli:
Mathematical programs with a two-dimensional reverse convex constraint. J. Glob. Optim. 1(2): 145-154 (1991) - [j25]Rainer E. Burkard, Ulrich Faigle:
Book reviews. ZOR Methods Model. Oper. Res. 35(4): 346-349 (1991) - [j24]Rainer E. Burkard, Franz Rendl:
Lexicographic bottleneck problems. Oper. Res. Lett. 10(5): 303-308 (1991) - 1990
- [j23]Rainer E. Burkard, Günter Rote, En-Yu Yao, Zhongliang Yu:
Shortest polygonal paths in space. Computing 45(1): 51-68 (1990) - [j22]Rainer E. Burkard, En-Yu Yao:
Constrained partitioning problems. Discret. Appl. Math. 28(1): 21-34 (1990) - [j21]Rainer E. Burkard:
Book review. ZOR Methods Model. Oper. Res. 34(4): 278 (1990)
1980 – 1989
- 1986
- [j20]Rainer E. Burkard:
Optimal schedules for periodically recurring events. Discret. Appl. Math. 15(2-3): 167-180 (1986) - [j19]Reinhardt Euler, Rainer E. Burkard, R. Grommes:
On latin squares and the facial structure of related polytopes. Discret. Math. 62(2): 155-181 (1986) - 1985
- [j18]Rainer E. Burkard:
Time-slot assignment for TDMA-systems. Computing 35(2): 99-112 (1985) - [j17]Rainer E. Burkard, Ulrich Fincke:
Probabilistic asymptotic properties of some combinatorial optimization problems. Discret. Appl. Math. 12(1): 21-29 (1985) - [j16]Franz Josef Radermacher, Thomas M. Liebling, Hansjörg Wacker, Siegfried Schaible, Rainer E. Burkard, A. Aigner, Raymond A. Cuninghame-Green:
Book reviews. Z. Oper. Research 29(5): 224-228 (1985) - 1983
- [j15]Rainer E. Burkard, Ulrich Fincke:
The asymptotic probabilistic behaviour of quadratic sum assignment problems. Z. Oper. Research 27(1): 73-81 (1983) - [j14]B. Nagels, B. Wobith, Mynt Zijlstra, Rainer E. Burkard, Hans Ziegler, Gustav Feichtinger:
Book reviews. Z. Oper. Research 27(1): 279-284 (1983) - 1982
- [j13]P. van Beek, Peter Hammann, Rainer E. Burkard, Hans Ziegler, A. Bachem:
Buchbesprechungen. Z. Oper. Research 26(1) (1982) - [j12]Rainer E. Burkard, Horst W. Hamacher, Jørgen Tind:
On abstract duality in mathematical programming. Z. Oper. Research 26(1): 197-209 (1982) - [j11]Rainer E. Burkard, Ulrich Fincke:
On random quadratic bottleneck assignment problems. Math. Program. 23(1): 227-232 (1982) - 1981
- [j10]Rainer E. Burkard, Hans Keiding, Peter M. Pruzan, Jakob Krarup:
A Relationship between optimality and efficiency in multicriteria 0-1 programming problems. Comput. Oper. Res. 8(4): 241-247 (1981) - 1980
- [j9]Rainer E. Burkard, Peter L. Hammer:
A note on Hamiltonian split graphs. J. Comb. Theory B 28(2): 245-248 (1980)
1970 – 1979
- 1978
- [j8]Rainer E. Burkard:
A general Hungarian method for the algebraic transportation problem. Discret. Math. 22(3): 219-232 (1978) - [j7]H. Helmut Merkel, H. Läpple, Peter Hammann, Heiner Müller-Merbach, Werner Krabs, Günter Fandel, Gert Dehnert, Rainer E. Burkard, B. Jahnke, R. Cremer, H. Sommer:
Buchbesprechungen. Z. Oper. Research 22(1): B233-B242 (1978) - 1977
- [j6]Rainer E. Burkard, Josef Offermann:
Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme. Math. Methods Oper. Res. 21(4): B121-B132 (1977) - [j5]Rainer E. Burkard, Willi Hahn, Uwe Zimmermann:
An algebraic approach to assignment problems. Math. Program. 12(1): 318-327 (1977) - 1975
- [j4]Rainer E. Burkard, H. Enge:
Algorithmus 25 Verfahren zur gemischt-ganzzahligen, konvexen Optimierung. Computing 14(4): 389-396 (1975) - [j3]Helmuth Späth, Helmut Wegmann, K. Fallaschinski, F. Münnich, Rainer E. Burkard, Thomas M. Liebling, Wolfgang Bühler, Josef Heinhold, K. Eicher, H. Läpple:
Buchbesprechungen. Z. Oper. Research 19(4): B141-B148 (1975) - [j2]Rainer E. Burkard:
Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme. Z. Oper. Research 19(5): 183-193 (1975) - 1970
- [j1]Rainer E. Burkard:
Untersuchungen zum Optimum-Mix Problem. Unternehmensforschung 14(1): 81-88 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: