Sequence independent lifting in mixed integer programming
From MaRDI portal
Publication:1977865
DOI10.1023/A:1009841107478zbMath0964.90030OpenAlexW1481126596MaRDI QIDQ1977865
Zonghao Gu, Savelsbergh, Martin W. P., Nemhauser, George I.
Publication date: 19 July 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009841107478
Related Items
Implicit cover inequalities, Knapsack polytopes: a survey, On the complexity of sequentially lifting cover inequalities for the knapsack polytope, Sequence Independent Lifting for the Set of Submodular Maximization Problem, Cutting planes for the multistage stochastic unit commitment problem, Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Separation algorithms for 0-1 knapsack polytopes, Valid Inequalities for Separable Concave Constraints with Indicator Variables, Local cuts for mixed-integer programming, Lifting two-integer knapsack inequalities, Robust network design: Formulations, valid inequalities, and computations, Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning, Lifting the knapsack cover inequalities for the knapsack polytope, Chance-Constrained Binary Packing Problems, Multi-period traffic routing in satellite networks, A cut-and-solve based algorithm for the single-source capacitated facility location problem, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, A cut-and-branch algorithm for the quadratic knapsack problem, A polyhedral study on chance constrained program with random right-hand side, A lifted-space dynamic programming algorithm for the quadratic knapsack problem, Constrained integer fractional programming problem with box constraints, Lifting for the integer knapsack cover polyhedron, Lifting for conic mixed-integer programming, Sequence independent lifting for mixed knapsack problems with GUB constraints, Chance-constrained set covering with Wasserstein ambiguity, New classes of facets for complementarity knapsack problems, 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, An effective hybrid approach to the two-stage capacitated facility location problem, On a generalization of the master cyclic group polyhedron, Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements, Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic, Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Approximate and exact merging of knapsack constraints with cover inequalities, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, Maximizing a class of submodular utility functions with constraints, Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem, Polyhedral results for a class of cardinality constrained submodular minimization problems, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints, A cutting plane approach for integrated planning and scheduling, Cutting planes in integer and mixed integer programming, On the exact separation of mixed integer knapsack cuts, Maximizing a class of submodular utility functions, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Flow pack facets of the single node fixed-charge flow polytope, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, The (not so) trivial lifting in two dimensions, Lifting convex inequalities for bipartite bilinear programs, Valid inequalities for separable concave constraints with indicator variables, On lifted cover inequalities: a new lifting procedure with unusual properties, New valid inequalities for the fixed-charge and single-node flow polytopes, Lifting convex inequalities for bipartite bilinear programs, Valid inequalities for mips and group polyhedra from approximate liftings, Risk-Averse Shortest Path Interdiction, On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra, Strong bounds for resource constrained project scheduling: preprocessing and cutting planes, Sequence independent lifting for a set of submodular maximization problems, Polyhedral description of the integer single node flow set with constant bounds, 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
