◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Schermer

1 paper hereh-index 7669 citations15 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.DS1

identity via Semantic Scholar / OpenAlex

collaborators

1 paper

cs.DS2024

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)

Mahdi Moeini, Daniel Schermer, Oliver Wendt

In operations research, the Knapsack Problem (KP) is one of the classical optimization problems that has been widely studied. The KP has several variants and, in this paper, we add…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.