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

DOI10.1016/J.ORL.2020.03.004MaRDI QIDQ2183195zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

branch-and-cutmixed-integer linear programmingpolyhedral combinatorics

Mathematics Subject Classification ID

Real functions (26-XX) Operations research, mathematical programming (90-XX)

Recommendations

• New valid inequalities for the fixed-charge and single-node flow polytopes
• Valid Linear Inequalities for Fixed Charge Problems
• Valid inequalities for mixed 0-1 programs
• Valid inequalities for the single arc design problem with set-ups
• Sequence independent lifting for mixed integer programs with variable upper bounds

Cites work

• Aggregation and Mixed Integer Rounding to Solve MIPs
• Cutting planes from conditional bounds: A new approach to set covering
• Fifty-plus years of combinatorial integer programming
• Flow pack facets of the single node fixed-charge flow polytope
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
• Local search inequalities
• Logic cuts for processing networks with fixed charges
• New valid inequalities for the fixed-charge and single-node flow polytopes
• PANDA: a software for polyhedral transformations
• Partial cover and complete cover inequalities
• Polyhedral approaches to mixed integer linear programming
• Sequence independent lifting in mixed integer programming
• Set Covering and Involutory Bases
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Solving the Orienteering Problem through Branch-and-Cut
• Submodularity and valid inequalities in capacitated fixed charge networks
• Technical Note—A Note on Zero-One Programming
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• The 0-1 knapsack problem with a single continuous variable
• The complementary class of generalized flow cover inequalities
• Valid inequalities for mixed 0-1 programs
• Valid Linear Inequalities for Fixed Charge Problems

Cited in

(2)

• Valid inequalities and separation for capacitated fixed charge flow problems
• On minimal valid inequalities for mixed integer conic programs

Describes a project that uses

Uses Software

• PANDA

This page was built for publication: Valid inequalities for mixed-integer programmes with fixed charges on sets of variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183195)