Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorZec C.
dc.contributor.authorMonfroy E.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:16:16Z
dc.date.available2020-09-02T22:16:16Z
dc.date.issued2014
dc.identifier10.1007/978-3-319-07857-1_91
dc.identifier.citation434 PART I, , 519-522
dc.identifier.issn18650929
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4259
dc.descriptionThe open pit mining problem aims at correctly identifying the set of blocks of a given mine to be extracted in order to maximize the net present value of the production. During the last years, different techniques have been proposed to solve mining problems, which range from the classic mathematical programming to more recent ones such as the metaheuristics. In this paper we illustrate how this problem can easily be solved by a relatively modern and declarative programming paradigm called constraint programming. © Springer International Publishing Switzerland 2014.
dc.language.isoen
dc.publisherSpringer Verlag
dc.subjectConstraint Programming
dc.subjectManufacturing Cell Design
dc.subjectMetaheuristics
dc.subjectConstraint theory
dc.subjectHeuristic algorithms
dc.subjectMathematical programming
dc.subjectOpen pit mining
dc.subjectConstraint programming
dc.subjectDeclarative Programming
dc.subjectMeta heuristics
dc.subjectMining problems
dc.subjectNet present value
dc.subjectComputer programming
dc.titleEasy Modeling of Open Pit Mining Problems via Constraint Programming
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record