Journal article · 2018

Convex preference cone-based approach for many objective optimization problems

Ankur Sinha, Pekka Malo, Markku Kallio

Computers & Operations Research, 95, 1–11 · Published 5 March 2018 · DOI 10.1016/j.cor.2018.02.015

View at the publisherCite this paper

In brief

“Convex preference cone-based approach for many objective optimization problems” is a 2018 journal article by Ankur Sinha and 2 co-authors, published in Computers & Operations Research. OpenAlex counts 26 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
26
Most cited in
2025 (8)
Field-weighted impact
2.05
References
32
Authors
3

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Sinha, A., Malo, P., & Kallio, M. (2018). Convex preference cone-based approach for many objective optimization problems. Computers & Operations Research, 95, 1–11. https://doi.org/10.1016/j.cor.2018.02.015

MLA 9

Sinha, Ankur, et al. “Convex preference cone-based approach for many objective optimization problems.” Computers & Operations Research, vol. 95, 2018, pp. 1–11. https://doi.org/10.1016/j.cor.2018.02.015.

Chicago

Sinha, Ankur, Pekka Malo, and Markku Kallio. 2018. “Convex preference cone-based approach for many objective optimization problems.” Computers & Operations Research 95: 1–11. https://doi.org/10.1016/j.cor.2018.02.015.

Harvard

Sinha, A., Malo, P. and Kallio, M. (2018) ‘Convex preference cone-based approach for many objective optimization problems’, Computers & Operations Research, 95, pp. 1–11. doi:10.1016/j.cor.2018.02.015.

IEEE

A. Sinha, P. Malo, and M. Kallio, “Convex preference cone-based approach for many objective optimization problems,” Computers & Operations Research, vol. 95, pp. 1–11, 2018, doi: 10.1016/j.cor.2018.02.015.

BibTeX

@article{sinha2018convex,
  title     = {{Convex preference cone-based approach for many objective optimization problems}},
  author    = {Sinha, Ankur and Malo, Pekka and Kallio, Markku},
  journal   = {Computers \& Operations Research},
  year      = {2018},
  volume    = {95},
  pages     = {1--11},
  doi       = {10.1016/j.cor.2018.02.015},
  url       = {https://doi.org/10.1016/j.cor.2018.02.015}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201955
202044
202111
202233
202322
202422
202588
202611

Its field-weighted citation impact is 2.05: it has been cited 2.05 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • many-objective optimization
  • interactive evolutionary computation
  • multi-criteria decision making
  • Pareto front approximation
  • merit function
  • facility location
  • user preferences

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Sinha, A., Malo, P., & Kallio, M. (2018). Convex preference cone-based approach for many objective optimization problems. Computers & Operations Research, 95, 1–11. https://doi.org/10.1016/j.cor.2018.02.015

How many times has this paper been cited?

26 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Ankur Sinha, Pekka Malo, Markku Kallio.

What is the DOI of this paper?

10.1016/j.cor.2018.02.015, permanently at https://doi.org/10.1016/j.cor.2018.02.015. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.