Rainer E. Burkard

From MaRDI portal
Revision as of 11:45, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Rainer E. Burkard to Rainer E. Burkard: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:170644

Available identifiers

zbMath Open burkard.rainer-eDBLP12/3113WikidataQ87003 ScholiaQ87003MaRDI QIDQ170644

List of research outcomes

PublicationDate of PublicationType
The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases2019-01-11Paper
The travelling salesman and the PQ-tree2019-01-11Paper
Polynomially solvable special cases of the quadratic bottleneck assignment problem2018-05-23Paper
A linear time algorithm for inverse obnoxious center location problems on networks2016-06-29Paper
On the traveling salesman problem with a relaxed Monge matrix2016-06-09Paper
Einführung in die Mathematische Optimierung2013-02-22Paper
https://portal.mardi4nfdi.de/entity/Q49027992013-01-17Paper
https://portal.mardi4nfdi.de/entity/Q31458002012-12-23Paper
Inverse center location problems2012-05-13Paper
Polynomially solvable special cases of the quadratic bottleneck assignment problem2012-04-04Paper
Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees2011-11-21Paper
Discrete optimization: an Austrian view2011-05-20Paper
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees2011-05-17Paper
Inverse \(p\)-median problems with variable edge lengths2011-05-05Paper
Inverse median location problems with variable coordinates2011-02-08Paper
Median problems with positive and negative weights on cycles and cacti2010-11-12Paper
The inverse Fermat-Weber problem2010-06-11Paper
Inverse 1-center location problems with edge length augmentation on trees2009-12-11Paper
On the Euclidean TSP with a permuted van der Veen matrix2009-07-21Paper
A polynomial method for the pos/neg weighted 3-median problem on a tree2009-03-25Paper
Assignment Problems2008-10-31Paper
The inverse 1-median problem on a cycle2008-10-29Paper
Reverse 2-median problem on trees2008-09-10Paper
Admissible transformations and assignment problems2008-07-29Paper
The \(p\)-maxian problem on a tree2008-01-21Paper
Modelling and Optimizing Batch Processes in the Chemical Industry2008-01-04Paper
An ant colony algorithm for the pos/neg weighted \(p\)-median problem2007-11-27Paper
The web proxy location problem in general tree of rings networks2007-10-12Paper
Monge properties, discrete convexity and applications2006-10-25Paper
A complex time based construction heuristic for batch scheduling problems in the chemical industry2006-09-13Paper
A linear time algorithm for the reverse 1‐median problem on a cycle2006-09-12Paper
The reel and sheet cutting problem in paper industry2006-06-12Paper
An asymptotical study of combinatorial optimization problems by means of statistical mechanics2005-11-01Paper
Inverse median problems2005-08-22Paper
https://portal.mardi4nfdi.de/entity/Q46673582005-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46648182005-04-08Paper
Constrained Steiner trees in Halin graphs2004-06-10Paper
Max algebra and the linear assignment problem2004-03-11Paper
Weight reduction problems with certain bottleneck objectives.2004-01-05Paper
Finding all essential terms of a characteristic maxpolynomial.2003-09-22Paper
https://portal.mardi4nfdi.de/entity/Q45192622003-09-03Paper
A note on the robust 1-center problem on trees2003-05-04Paper
Center problems with pos/neg weights on trees2003-04-10Paper
https://portal.mardi4nfdi.de/entity/Q47953762003-02-24Paper
https://portal.mardi4nfdi.de/entity/Q45474662003-01-30Paper
Selected topics on assignment problems2002-09-17Paper
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms2002-07-21Paper
The Travelling Salesman and the PQ-Tree2001-11-26Paper
The Obnoxious Center Problem on a Tree2001-11-11Paper
Robust location problems with pos/neg weights on a tree2001-10-14Paper
Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.2001-06-14Paper
2-medians in trees with pos/neg weights2001-02-27Paper
https://portal.mardi4nfdi.de/entity/Q49443022001-02-09Paper
OR Utopia2001-01-02Paper
Bottleneck Capacity Expansion Problems with General Budget Constraints2001-01-01Paper
The simple block iterative algorithm of an extended entropy model and its convergence2000-11-28Paper
Volume maximization and orthoconvex approximation of orthogons2000-10-29Paper
https://portal.mardi4nfdi.de/entity/Q42474622000-09-26Paper
Location problems: From classical geometry to managerial decisions2000-08-10Paper
https://portal.mardi4nfdi.de/entity/Q44928992000-07-27Paper
A process scheduling problem arising from chemical production planning2000-06-04Paper
A transportation problem with a permuted demand vector1999-11-01Paper
https://portal.mardi4nfdi.de/entity/Q42334091999-07-21Paper
The travelling salesman problem on permuted Monge matrices1999-07-20Paper
A minimax assignment problem in treelike communication networks1999-07-05Paper
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases1999-06-28Paper
A linear compound algorithm for uniform machine scheduling1999-03-16Paper
A note on MULTIFIT scheduling for uniform machines1998-12-21Paper
https://portal.mardi4nfdi.de/entity/Q42106381998-09-24Paper
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey1998-09-21Paper
https://portal.mardi4nfdi.de/entity/Q43983781998-07-19Paper
Heuristics for biquadratic assignment problems and their computational comparison1998-06-11Paper
The inverse-parametric knapsack problem1998-06-11Paper
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus1998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43821241998-03-26Paper
Hamiltonian cycles in circulant digraphs with two stripes1998-02-17Paper
https://portal.mardi4nfdi.de/entity/Q43696311998-01-05Paper
https://portal.mardi4nfdi.de/entity/Q43631631997-11-13Paper
Efficiently solvable special cases of hard combinatorial optimization problems1997-08-28Paper
QAPLIB - a quadratic assignment problem library1997-07-23Paper
https://portal.mardi4nfdi.de/entity/Q31256561997-07-06Paper
Cut and patch Steiner trees for ladders1997-06-09Paper
Perspectives of Monge properties in optimization1996-10-09Paper
Three-dimensional axial assignment problems with decomposable cost coefficients1996-10-03Paper
On the role of bottleneck Monge matrices in combinatorial optimization1996-05-02Paper
Vehicle routing in an automated warehouse: Analysis and optimization1996-02-18Paper
Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood1995-05-04Paper
https://portal.mardi4nfdi.de/entity/Q43215511995-01-23Paper
Vehicle scheduling in two-cycle flexible manufacturing systems1995-01-11Paper
Erratum to: Constrained partitioning problems1994-01-16Paper
https://portal.mardi4nfdi.de/entity/Q42740161994-01-03Paper
The quickest flow problem1993-05-03Paper
https://portal.mardi4nfdi.de/entity/Q40319771993-05-03Paper
Sandwich approximation of univariate convex functions with an application to separable convex programming1992-06-28Paper
Mathematical programs with a two-dimensional reverse convex constraint1992-06-28Paper
Lexicographic bottleneck problems1992-06-27Paper
Reshipments and overshipments in transportation problems with minimax objective1992-06-27Paper
Efficiently solvable special cases of bottleneck travelling salesman problems1992-06-26Paper
QAPLIB-A quadratic assignment problem library1991-01-01Paper
Universal conditions for algebraic travelling salesman problems to be efficiently solvable1991-01-01Paper
Constrained partitioning problems1990-01-01Paper
Special cases of travelling salesman problems and heuristics1990-01-01Paper
Cyclic schedules for r irregularity occurring events1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33486911990-01-01Paper
Approximation of convex curves with application to the bicriterial minimum cost flow problem1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34871121989-01-01Paper
On the dimension of polytopes of planar three-index transportation problems1989-01-01Paper
Saddlepoints in group and semigroup minimization1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37471971987-01-01Paper
On Latin squares and the facial structure of related polytopes1986-01-01Paper
Optimal schedules for periodically recurring events1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37544261986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51870781985-01-01Paper
Probabilistic asymptotic properties of some combinatorial optimization problems1985-01-01Paper
Time-slot assignment for TDMA-systems1985-01-01Paper
On general decomposition schemes in mathematical programming1985-01-01Paper
Quadratic assignment problems1984-01-01Paper
A thermodynamically motivated simulation procedure for combinatorial optimization problems1984-01-01Paper
Eigenfunctions and optimal orbits1984-01-01Paper
Some relationships between multicriteria and parametric discrete optimization problems with bottleneck objectives1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36968561984-01-01Paper
A heuristic for quadratic Boolean programs with applications to quadratic assignment problems1983-01-01Paper
The asymptotic probabilistic behaviour of quadratic sum assignment problems1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36734861983-01-01Paper
On random quadratic bottleneck assignment problems1982-01-01Paper
Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39427591982-01-01Paper
On abstract duality in mathematical programming1982-01-01Paper
Admissible Transformations and their Application to Matching Problems1981-01-01Paper
Minimal cost flows in regular matroids1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39050871981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39087641980-01-01Paper
Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis1980-01-01Paper
A note on Hamiltonian split graphs1980-01-01Paper
Weakly admissible transformations for solving algebraic assignment and transportation problems1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38805811980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41901371979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41918421979-01-01Paper
Travelling Salesman and Assignment Problems: A Survey1979-01-01Paper
Numerical investigations on quadratic assignment problems1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41875821978-01-01Paper
Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme1977-01-01Paper
An algebraic approach to assignment problems1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41566061977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41465041976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40697011975-01-01Paper
Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40731291975-01-01Paper
Algorithmus 25. Verfahren zur gemischt-ganzzahligen konvexen Optimierung1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41369331974-01-01Paper
Zur methode der approximierenden optimiernng1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47668051973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47671191973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56481491972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56554121972-01-01Paper
Kriterien, wann arithmetische Reihen Zahlen enthalten, die sich als Summe zweier Quadrate darstellen lassen1972-01-01Paper
Untersuchungen zum Optimum-Mix Problem1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56264231970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56104451969-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Rainer E. Burkard