Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
From MaRDI portal
Publication:1586209
DOI10.1007/s101070050067zbMath0977.90030OpenAlexW1985990685MaRDI QIDQ1586209
Zonghao Gu, Nemhauser, George I., Savelsbergh, Martin W. P.
Publication date: 12 November 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050067
Related Items
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, Knapsack polytopes: a survey, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Valid Inequalities for Separable Concave Constraints with Indicator Variables, Theoretical challenges towards cutting-plane selection, Local cuts for mixed-integer programming, Lifting two-integer knapsack inequalities, Robust network design: Formulations, valid inequalities, and computations, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope, Lifting, tilting and fractional programming revisited, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, Sequence independent lifting for mixed knapsack problems with GUB constraints, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, Towards optimal formwork pairing on construction sites, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting, Tightening simple mixed-integer sets with guaranteed bounds, Fixed-charge transportation on a path: optimization, LP formulations and separation, Foundation-penalty cuts for mixed-integer programs., LS-LIB: A Library of Tools for Solving Production Planning Problems, A polyhedral study of lot-sizing with supplier selection, Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling, Facets for the single node fixed-charge network set with a node set-up variable, Fixed-charge transportation problems on trees, On the transportation problem with market choice, Box-constrained quadratic programs with fixed charge variables, Fixed-Charge Transportation on a Path: Linear Programming Formulations, Nonconvex, lower semicontinuous piecewise linear optimization, Generalized coefficient strengthening cuts for mixed integer programming, Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem, Multi-commodity variable upper bound flow models, Supermodular covering knapsack polytope, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem, Maximum utility product pricing models and algorithms based on reservation price, Progress in computational mixed integer programming -- a look back from the other side of the tipping point, Cutting planes in integer and mixed integer programming, A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\), The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Convex hull results for generalizations of the constant capacity single node flow set, Flow pack facets of the single node fixed-charge flow polytope, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, Lifting convex inequalities for bipartite bilinear programs, Valid inequalities for separable concave constraints with indicator variables, New valid inequalities for the fixed-charge and single-node flow polytopes, Lifting convex inequalities for bipartite bilinear programs, On cut-based inequalities for capacitated network design polyhedra, Face dimensions of general-purpose cutting planes for mixed-integer linear programs, On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra, Sequence independent lifting for mixed integer programs with variable upper bounds, Lifting for mixed integer programs with variable upper bounds, Cover and pack inequalities for (mixed) integer programming, Integer-programming software systems
Uses Software
