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

Research

Associated organisational units

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

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

Links

Text available via DOI:

Keywords

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Valid inequalities for mixed-integer programmes with fixed charges on sets of variables. / Letchford, Adam; Souli, Georgia.
In: Operations Research Letters, Vol. 48, No. 3, 01.05.2020, p. 240-244.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Letchford, A & Souli, G 2020, 'Valid inequalities for mixed-integer programmes with fixed charges on sets of variables', Operations Research Letters, vol. 48, no. 3, pp. 240-244. https://doi.org/10.1016/j.orl.2020.03.004

APA

Letchford, A., & Souli, G. (2020). Valid inequalities for mixed-integer programmes with fixed charges on sets of variables. Operations Research Letters, 48(3), 240-244. https://doi.org/10.1016/j.orl.2020.03.004

Vancouver

Letchford A, Souli G. Valid inequalities for mixed-integer programmes with fixed charges on sets of variables. Operations Research Letters. 2020 May 1;48(3):240-244. Epub 2020 Mar 23. doi: 10.1016/j.orl.2020.03.004

Author

Letchford, Adam ; Souli, Georgia. / Valid inequalities for mixed-integer programmes with fixed charges on sets of variables. In: Operations Research Letters. 2020 ; Vol. 48, No. 3. pp. 240-244.

Bibtex

@article{1af5a1af0cf14f2bb86326d21df123e2,
title = "Valid inequalities for mixed-integer programmes with fixed charges on sets of variables",
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.",
keywords = "mixed-integer linear programming, branch-and-cut, polyhedral combinatorics",
author = "Adam Letchford and Georgia Souli",
note = "This is the author{\textquoteright}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",
year = "2020",
month = may,
day = "1",
doi = "10.1016/j.orl.2020.03.004",
language = "English",
volume = "48",
pages = "240--244",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "3",

}

RIS

TY - JOUR

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

AU - Letchford, Adam

AU - Souli, Georgia

N1 - 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

PY - 2020/5/1

Y1 - 2020/5/1

N2 - 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.

AB - 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.

KW - mixed-integer linear programming

KW - branch-and-cut

KW - polyhedral combinatorics

U2 - 10.1016/j.orl.2020.03.004

DO - 10.1016/j.orl.2020.03.004

M3 - Journal article

VL - 48

SP - 240

EP - 244

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 3

ER -