◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Moeini

5 papers hereh-index 151.1k citations46 works total

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

author position
  • sole author1
  • first author2
  • middle author1
  • last author1

Across the 5 of 5 papers where every author was matched, so the position is known.

fields
  • cs.CE2
  • cs.AI1
  • cs.CG1
  • cs.DS1
same name
  • M. Moeini — 3 papers, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedPortfolio Selection Under Buy-In Threshold Constraints Using DC Programming and DCA

5 citations · 9 across the 5 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

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.