Journal of Industrial and Management Optimization 2020

5 papers
The 2020 edition of the Journal of Industrial and Management Optimization featured research focused on algorithmic development and applied optimization across several sectors. Key themes included advancements in data clustering techniques, such as side-information-induced sparse subspace clustering and functional k-means problems. Additionally, the journal published work on non-submodular maximization using stochastic-lazier-greedy algorithms, reflecting a focus on improving computational efficiency in complex mathematical programming. Applied research during this year addressed practical challenges in energy management and medical technology. Notable contributions included the use of adjustable robust optimization for the economic dispatch of combined cooling, heating, and power microgrids, specifically accounting for uncertainties in wind-solar power and electric vehicle integration. Other studies explored the integration of haptic feedback in maxillofacial surgical simulation systems. Prolific contributors to the volume included researchers such as Dongmei Zhang, Min Li, and Bin Li, among others, who contributed to the year's emphasis on bridging theoretical optimization with industrial and clinical applications.

Top Research Directions

The 5 research directions with Journal of Industrial and Management Optimization 2020 papers, ranked by paper count, next to 2019. Share is the fraction of the edition’s papers in the direction.

#Direction20202019Share 2020Share 20192019 rank
1Bounding Greedy Performance via the Submodularity Ratio1020.0%0.0%—
2Non-Monotone Submodular Optimization1020.0%0.0%—
3Overcoming the Haptic Void in Minimally Invasive Surgery1020.0%0.0%—
4Scaling Greedy Optimization via Randomized Candidate Sampling1020.0%0.0%—
5The Empirical Validation Gap1020.0%0.0%—

Download all directions as CSV

Institutions

Institutions credited by Journal of Industrial and Management Optimization 2020 papers: a paper credits every institution named in its affiliations, once. 8 institutions share 2 credited papers.

#InstitutionPapersShare20192019 rank
1Academy of Mathematics and Systems Science 150.0%0—
2Beijing University of Technology 150.0%0—
3Chinese Academy of Sciences 150.0%0—
4Hong Kong Polytechnic University 150.0%0—
5Macau University of Science and Technology 150.0%0—
6Shandong Jianzhu University 150.0%0—
7Shandong Normal University 150.0%0—
8Sichuan University 150.0%0—

Download all institutions as CSV

About this data

Papers. Journal of Industrial and Management Optimization 2020 lists 5 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 2019 use shares, since the edition went from 7 to 5 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 2 of 5 papers (40.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-18 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Journal of Industrial and Management Optimization 2020”, https://lacuna.tiptreesystems.com/venue/journal-of-industrial-and-management-optimization/2020.

Top Authors

AuthorPapers
Jing Qin1

Papers

Title
Adjustable robust optimization in enabling optimal day-ahead economic dispatch of CCHP-MG considering uncertainties of wind-solar power and electric vehicle
Maxillofacial surgical simulation system with haptic feedback
Side-information-induced reweighted sparse subspace clustering
Stochastic-Lazier-Greedy Algorithm for monotone non-submodular maximization
The approximation algorithm based on seeding method for functional $ k $-means problem<sup>†</sup>