Acalci 2016

2 papers

Top Research Directions

The 5 research directions with Acalci 2016 papers, ranked by paper count, next to 2015. Share is the fraction of the edition’s papers in the direction.

#Direction20162015Share 2016Share 20152015 rank
1Algorithmic Generalization in Combinatorial Optimization1050.0%0.0%—
2Escaping Local Optima with Simulated Annealing1050.0%0.0%—
3Extending Optimization Frameworks to Multi Objective Problems1050.0%0.0%—
4Scaling Solvers for NP-Hard Scheduling Problems1050.0%0.0%—
5Synergistic Global Exploration and Local Refinement1050.0%0.0%—

Download all directions as CSV

Institutions

Institutions credited by Acalci 2016 papers: a paper credits every institution named in its affiliations, once. 3 institutions share 1 credited papers.

#InstitutionPapersShare20152015 rank
104ywz9252 1100.0%0—
2RMIT University 1100.0%0—
3Sharif University of Technology 1100.0%0—

Download all institutions as CSV

About this data

Papers. Acalci 2016 lists 2 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 2015 use shares, since the edition went from 3 to 2 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 1 of 2 papers (50.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-21 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Acalci 2016”, https://lacuna.tiptreesystems.com/venue/acalci/2016.

Top Authors

AuthorPapers
Xiaodong Lin2

Papers

Title
A Delaunay Triangulation Based Density Measurement for Evolutionary Multi-objective Optimization
A Hybrid Imperialist Competitive Algorithm for the Flexible Job Shop Problem