Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
From MaRDI portal
Publication:2183195
DOI10.1016/j.orl.2020.03.004OpenAlexW3011146854MaRDI QIDQ2183195
Adam N. Letchford, Georgia Souli
Publication date: 26 May 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/142375/1/fixed_charges_on_subsets.pdf
Uses Software
Cites Work
- Unnamed Item
- PANDA: a software for polyhedral transformations
- Valid inequalities for mixed 0-1 programs
- Submodularity and valid inequalities in capacitated fixed charge networks
- The 0-1 knapsack problem with a single continuous variable
- Logic cuts for processing networks with fixed charges
- Partial cover and complete cover inequalities
- The complementary class of generalized flow cover inequalities
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Local search inequalities
- Sequence independent lifting in mixed integer programming
- New valid inequalities for the fixed-charge and single-node flow polytopes
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Polyhedral Approaches to Mixed Integer Linear Programming
- Fifty-Plus Years of Combinatorial Integer Programming
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Valid Linear Inequalities for Fixed Charge Problems
- Cutting planes from conditional bounds: A new approach to set covering
- Technical Note—A Note on Zero-One Programming
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Solving the Orienteering Problem through Branch-and-Cut
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Set Covering and Involutory Bases
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Flow pack facets of the single node fixed-charge flow polytope
