ScholarIQanswers from OpenAlex

Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming

PaperCitations, authors & open-access status

Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming is a paper indexed in ScholarIQ from OpenAlex.

How many citations does Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming have?

ScholarIQcitation count

Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming has 13 citations in the OpenAlex counts ScholarIQ stores.

When was Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming published?

ScholarIQyear

Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming has 2020 year in the ScholarIQ index.

What is the open-access status of Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming?

ScholarIQoa status

Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming has closed oa status in the ScholarIQ index.

What is the DOI of Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming?

ScholarIQdoi

The DOI for Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming is on the source record.

What is the OpenAlex record for Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming?

ScholarIQopenalex

The OpenAlex for Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming is on the source record.

Related on ScholarIQ

470M+ articles · 14-day free trial