Home > Research > Publications & Outputs > Valid inequalities for mixed-integer programmes...

Electronic data

  • fixed-charges-on-subsets

    Rights statement: This is the author’s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, 48, 3, 2020 DOI: 10.1016/j.orl.2020.03.004

    Accepted author manuscript, 308 KB, PDF document

    Embargo ends: 23/09/21

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

Links

Text available via DOI:

View graph of relations

Valid inequalities for mixed-integer programmes with fixed charges on sets of variables

Research output: Contribution to journalJournal article

Published
<mark>Journal publication date</mark>1/05/2020
<mark>Journal</mark>Operations Research Letters
Issue number3
Volume48
Number of pages5
Pages (from-to)240-244
Publication statusPublished
Early online date23/03/20
Original languageEnglish

Abstract

We consider mixed 0-1 linear programs in which one is given a collection of (not necessarily disjoint) sets of variables and, for each set, a fixxed charge is incurred if and only if at least one of the variables in the set takes a positive value. We derive strong valid linear inequalities for these problems, and show that they generalise and dominate a subclass of the well-known flow cover inequalities for the classical fixed-charge problem.

Bibliographic note

This is the author’s version of a work that was accepted for publication in Operations Research Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Operations Research Letters, 48, 3, 2020 DOI: 10.1016/j.orl.2020.03.004