Journal of the Operations Research Society of Japan 2020

1 papers

Top Research Directions

The 4 research directions with Journal of the Operations Research Society of Japan 2020 papers, ranked by paper count, next to 2018. Share is the fraction of the edition’s papers in the direction.

#Direction20202018Share 2020Share 20182018 rank
1Addressing the Myopia of Greedy Subset Selection10100.0%0.0%—
2Dual Bound Pruning for Efficient Search10100.0%0.0%—
3Iterative Constraint Generation for Large Scale Optimization10100.0%0.0%—
4Scaling Submodular Optimization to Massive Datasets10100.0%0.0%—

Download all directions as CSV

About this data

Papers. Journal of the Operations Research Society of Japan 2020 lists 1 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2018 use shares, since the edition went from 1 to 1 papers.

Data. Counts come from Lacuna’s data build of 2026-11-17 and change as papers are added. Tables as CSV: directions. Cite as: Lacuna, “Journal of the Operations Research Society of Japan 2020”, https://lacuna.tiptreesystems.com/venue/journal-of-the-operations-research-society-of-japan/2020.

Papers

Title
AN EFFICIENT BRANCH-AND-CUT ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION