Article (2000)
An external link is available for this item
| Additional Information: | This work was initiated while the author was at GERAD/École Polytechnique de Montréal, where it was supported by NSERC-network grant NET0200815. |
|---|---|
| Department: | Department of Mathematics and Industrial Engineering |
| Research Center: | GERAD - Research Group in Decision Analysis |
| Funders: | NSERC |
| Grant number: | NET0200815 |
| PolyPublie URL: | https://publications.polymtl.ca/69290/ |
| Journal Title: | Journal of Global Optimization (vol. 18, no. 4) |
| Publisher: | Springer Science+Business Media |
| DOI: | 10.1023/a:1026548217241 |
| Official URL: | https://doi.org/10.1023/a%3a1026548217241 |
| Date Deposited: | 29 Oct 2025 11:25 |
| Last Modified: | 29 Oct 2025 11:25 |
| Cite in APA 7: | Meyer, C. (2000). A Simple Finite Cone Covering Algorithm for Concave Minimization. Journal of Global Optimization, 18(4), 357-365. https://doi.org/10.1023/a%3a1026548217241 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
