Hartmut Noltemeier

From MaRDI portal
(Redirected from Person:647398)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Modifying networks to obtain low cost trees2024-06-05Paper
Complexity and approximability of certain bicriteria location problems
Graph-Theoretic Concepts in Computer Science
2024-02-28Paper
Compact location problems with budget and communication constraints
Lecture Notes in Computer Science
2023-12-12Paper
Improving spanning trees by upgrading nodes
Automata, Languages and Programming
2018-07-04Paper
Graph-theoretic concepts and algorithms
Leitfäden der Informatik
2012-10-02Paper
Optimizing cost flows by edge cost and capacity upgrade
Journal of Discrete Algorithms
2007-04-26Paper
Multiple voting location and single voting location on trees
European Journal of Operational Research
2007-04-19Paper
scientific article; zbMATH DE number 2202358 (Why is no real title available?)2005-09-05Paper
Upgrading trees under diameter and budget constraints
Networks
2003-03-10Paper
scientific article; zbMATH DE number 1696527 (Why is no real title available?)2002-07-09Paper
On the flow cost lowering problem
European Journal of Operational Research
2002-06-16Paper
scientific article; zbMATH DE number 1803766 (Why is no real title available?)2002-01-01Paper
Upgrading bottleneck constrained forests
Discrete Applied Mathematics
2001-10-30Paper
scientific article; zbMATH DE number 1487883 (Why is no real title available?)2000-08-10Paper
Improving Minimum Cost Spanning Trees by Upgrading Nodes
Journal of Algorithms
2000-02-06Paper
Improving spanning trees by upgrading nodes
Theoretical Computer Science
2000-01-12Paper
Approximation algorithms for certain network improvement problems
Journal of Combinatorial Optimization
1999-03-28Paper
scientific article; zbMATH DE number 1262800 (Why is no real title available?)1999-03-15Paper
Modifying edges of a network to obtain short subgraphs
Theoretical Computer Science
1999-01-12Paper
scientific article; zbMATH DE number 1076395 (Why is no real title available?)1998-10-12Paper
scientific article; zbMATH DE number 1163718 (Why is no real title available?)1998-08-04Paper
Compact location problems
Theoretical Computer Science
1998-07-22Paper
scientific article; zbMATH DE number 1076397 (Why is no real title available?)1998-04-22Paper
scientific article; zbMATH DE number 917638 (Why is no real title available?)1996-11-26Paper
scientific article; zbMATH DE number 579312 (Why is no real title available?)1994-05-31Paper
scientific article; zbMATH DE number 579118 (Why is no real title available?)1994-05-31Paper
scientific article; zbMATH DE number 432985 (Why is no real title available?)1994-03-29Paper
scientific article; zbMATH DE number 432984 (Why is no real title available?)1993-11-11Paper
scientific article; zbMATH DE number 176585 (Why is no real title available?)1993-05-18Paper
scientific article; zbMATH DE number 176584 (Why is no real title available?)1993-05-18Paper
scientific article; zbMATH DE number 4147479 (Why is no real title available?)1990-01-01Paper
On separable clusterings
Journal of Algorithms
1989-01-01Paper
scientific article; zbMATH DE number 4074475 (Why is no real title available?)1988-01-01Paper
Clustering methods for geometric objects and applications to design problems
The Visual Computer
1986-01-01Paper
scientific article; zbMATH DE number 3896269 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3787986 (Why is no real title available?)1982-01-01Paper
scientific article; zbMATH DE number 3750246 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3711361 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3722072 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3733296 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3598511 (Why is no real title available?)1978-01-01Paper
scientific article; zbMATH DE number 3482367 (Why is no real title available?)1976-01-01Paper
Reduktion von Präzedenzstrukturen
Zeitschrift für Operations Research
1976-01-01Paper
scientific article; zbMATH DE number 3501262 (Why is no real title available?)1976-01-01Paper
An algorithm for the determination of longest distances in a graph
Mathematical Programming
1975-01-01Paper
scientific article; zbMATH DE number 3476888 (Why is no real title available?)1973-01-01Paper
scientific article; zbMATH DE number 3488915 (Why is no real title available?)1973-01-01Paper
scientific article; zbMATH DE number 3438353 (Why is no real title available?)1972-01-01Paper
scientific article; zbMATH DE number 3404029 (Why is no real title available?)1972-01-01Paper
Ein Branch-and-Bound-Verfahren-Generator. (A branch-and-bound method generator)
Computing
1971-01-01Paper
scientific article; zbMATH DE number 3349630 (Why is no real title available?)1971-01-01Paper
scientific article; zbMATH DE number 3323652 (Why is no real title available?)1970-01-01Paper
scientific article; zbMATH DE number 3333036 (Why is no real title available?)1970-01-01Paper
scientific article; zbMATH DE number 3298504 (Why is no real title available?)1969-01-01Paper
Zum Auswahlproblem
Numerische Mathematik
1968-01-01Paper
Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen
Unternehmensforschung Operations Research - Recherche Opérationnelle
1968-01-01Paper
scientific article; zbMATH DE number 3307187 (Why is no real title available?)1968-01-01Paper


Research outcomes over time


This page was built for person: Hartmut Noltemeier