IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v47y2024i2d10.1007_s10878-024-01109-x.html
   My bibliography  Save this article

A linear ordering problem with weighted rank

Author

Listed:
  • Manuel V. C. Vieira

    (NOVA School of Science and Technology)

Abstract

This paper introduces an integer linear program for a variant of the linear ordering problem. This considers, besides the pairwise preferences in the objective function as the linear ordering problem, positional preferences (weighted rank) in the objective. The objective function is mathematically supported, as the full integer linear program is motivated by the instant run-off voting method to aggregate individual preferences. The paper describes two meta-heuristics, iterated local search and Memetic algorithms to deal with large instances which are hard to solve to optimality. These results are compared with the objective value of the linear relaxation. The instances used are the ones available from the LOP library, and new real instances with preferences given by juries.

Suggested Citation

  • Manuel V. C. Vieira, 2024. "A linear ordering problem with weighted rank," Journal of Combinatorial Optimization, Springer, vol. 47(2), pages 1-24, March.
    • Handle: RePEc:spr:jcomop:v:47:y:2024:i:2:d:10.1007_s10878-024-01109-x
    DOI: 10.1007/s10878-024-01109-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01109-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-024-01109-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:47:y:2024:i:2:d:10.1007_s10878-024-01109-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.