Sequence independent lifting for mixed integer programs with variable upper bounds

DOI10.1007/S10107-005-0664-6MaRDI QIDQ2583140zbMATH OpenOpenAlexFDO

Authors S. Shebalov, Diego Klabjan

Publication date 13 January 2006

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-005-0664-6

zbMATH Keywords

Mixed integer programmingPolyhedral theory

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• Lifting for mixed integer programs with variable upper bounds
• Sequence independent lifting in mixed integer programming
• Sequence independent lifting of cover inequalities
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Sequence Independent Lifting for Mixed-Integer Programming

Cites work

• A Polyhedral Study of Integer Variable Upper Bounds
• Capacitated facility location: Separation algorithms and computational experience
• Capacitated Network Design—Polyhedral Structure and Computation
• Cutting planes in integer and mixed integer programming
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• On the polyhedral structure of a multi-item production planning model with setup times
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• Sequence independent lifting for mixed integer programs with variable upper bounds
• Sequence independent lifting in mixed integer programming
• The 0-1 knapsack problem with a single continuous variable
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
• Valid Inequalities and Superadditivity for 0–1 Integer Programs
• Valid inequalities for mixed 0-1 programs
• Valid inequalities for problems with additive variable upper bounds
• Valid Linear Inequalities for Fixed Charge Problems

Cited in

(20)

• Lifted flow cover inequalities for mixed 0-1 integer programs
• Multi-commodity variable upper bound flow models
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
• Sequence independent lifting in mixed integer programming
• Convex hull results for generalizations of the constant capacity single node flow set
• Sequence independent lifting for a set of submodular maximization problems
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
• Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
• Lifting for mixed integer programs with variable upper bounds
• Sequence independent lifting for mixed integer programs with variable upper bounds
• Lifted Euclidean inequalities for the integer single node flow set with upper bounds
• Sequence Independent Lifting for Mixed-Integer Programming
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
• Sequence Independent Lifting for the Set of Submodular Maximization Problem
• Sequence independent lifting of cover inequalities
• Sequence independent, simultaneous and multidimensional lifting of generalized flow covers for the semi-continuous knapsack problem with generalized upper bounds constraints
• A Polyhedral Study of Integer Variable Upper Bounds
• The continuous knapsack set
• Lifting for the integer knapsack cover polyhedron
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs

This page was built for publication: Sequence independent lifting for mixed integer programs with variable upper bounds

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