Home > Research > Browse

Research

Results for mixed-integer linear programming

Publications & Outputs

  1. Lifting the knapsack cover inequalities for the knapsack polytope

    Letchford, A. & Souli, G., 1/09/2020, In: Operations Research Letters. 48, 5, p. 607-611 5 p.

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

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

    Letchford, A. & Souli, G., 1/05/2020, In: Operations Research Letters. 48, 3, p. 240-244 5 p.

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

  3. New valid inequalities for the fixed-charge and single-node flow polytopes

    Letchford, A. & Souli, G., 1/09/2019, In: Operations Research Letters. 47, 5, p. 353-357 5 p.

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

  4. A State Transition MIP Formulation for the Unit Commitment Problem

    Atakan, S., Lulli, G. & Sen, S., 01/2018, In: IEEE Transactions on Power Systems. 33, 1, p. 736-748 13 p.

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