IDEAS home Printed from https://ideas.repec.org/p/ete/kbiper/522409.html
   My bibliography  Save this paper

Balanced optimization with vector costs

Author

Listed:
  • Annette Ficker
  • Frits Spieksma
  • Gerhard Woeginger

Abstract

We consider so-called balanced optimization problems with vector costs. We propose a framework containing such problems; this framework allows us to investigate the complexity and approximability of these problems in a general setting. More concrete, each problem in the framework admits a 2-approximation, and for many problems within the framework this result is best-possible, in the sense that having a polynomial-time algorithm with a performance ratio better than 2 would imply P=NP. Special attention is paid to the balanced assignment problem with vector costs: we show that the problem remains NP-hard even in case of sum costs.

Suggested Citation

  • Annette Ficker & Frits Spieksma & Gerhard Woeginger, 2016. "Balanced optimization with vector costs," Working Papers of Department of Decision Sciences and Information Management, Leuven 522409, KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven.
  • Handle: RePEc:ete:kbiper:522409
    as

    Download full text from publisher

    File URL: https://lirias.kuleuven.be/bitstream/123456789/522409/1/KBI_1601.pdf
    File Function: Balanced optimization with vector costs
    Download Restriction: intranet
    ---><---

    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:ete:kbiper:522409. 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: library EBIB (email available below). General contact details of provider: https://feb.kuleuven.be/KBI .

    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.