Hartmut Noltemeier

From MaRDI portal
Revision as of 05:36, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:647398

Available identifiers

zbMath Open noltemeier.hartmutMaRDI QIDQ647398

List of research outcomes





PublicationDate of PublicationType
Modifying networks to obtain low cost trees2024-06-05Paper
Complexity and approximability of certain bicriteria location problems2024-02-28Paper
Compact location problems with budget and communication constraints2023-12-12Paper
Improving spanning trees by upgrading nodes2018-07-04Paper
Graphentheoretische Konzepte und Algorithmen2012-10-02Paper
Optimizing cost flows by edge cost and capacity upgrade2007-04-26Paper
Multiple voting location and single voting location on trees2007-04-19Paper
https://portal.mardi4nfdi.de/entity/Q53145672005-09-05Paper
Upgrading trees under diameter and budget constraints2003-03-10Paper
https://portal.mardi4nfdi.de/entity/Q27666752002-07-09Paper
On the flow cost lowering problem2002-06-16Paper
https://portal.mardi4nfdi.de/entity/Q31476692002-01-01Paper
Upgrading bottleneck constrained forests2001-10-30Paper
https://portal.mardi4nfdi.de/entity/Q44944122000-08-10Paper
Improving Minimum Cost Spanning Trees by Upgrading Nodes2000-02-06Paper
Improving spanning trees by upgrading nodes2000-01-12Paper
Approximation algorithms for certain network improvement problems1999-03-28Paper
https://portal.mardi4nfdi.de/entity/Q42327901999-03-15Paper
Modifying edges of a network to obtain short subgraphs1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q43597521998-10-12Paper
https://portal.mardi4nfdi.de/entity/Q43953311998-08-04Paper
Compact location problems1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43597551998-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48884381996-11-26Paper
https://portal.mardi4nfdi.de/entity/Q42936381994-05-31Paper
https://portal.mardi4nfdi.de/entity/Q42937701994-05-31Paper
https://portal.mardi4nfdi.de/entity/Q31391231994-03-29Paper
https://portal.mardi4nfdi.de/entity/Q31391221993-11-11Paper
https://portal.mardi4nfdi.de/entity/Q40357601993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40357611993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q34779391990-01-01Paper
On separable clusterings1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38058941988-01-01Paper
Clustering methods for geometric objects and applications to design problems1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36754961984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39655481982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39024751981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39113661981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39206791981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39354381981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41654081978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40655641976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40825671976-01-01Paper
Reduktion von Präzedenzstrukturen1976-01-01Paper
An algorithm for the determination of longest distances in a graph1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40607281973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40706251973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44043991972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56704421972-01-01Paper
Ein Branch-and-Bound-Verfahren-Generator. (A branch-and-bound method generator)1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56249801971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56037321970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56098671970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55787261969-01-01Paper
Zum Auswahlproblem1968-01-01Paper
Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55883031968-01-01Paper

Research outcomes over time

This page was built for person: Hartmut Noltemeier