Sequence independent lifting in mixed integer programming
From MaRDI portal
Recommendations
Cited in
(75)- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- Sequence independent lifting for a set of submodular maximization problems
- Polyhedral description of the integer single node flow set with constant bounds
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Implicit cover inequalities
- Lifting the knapsack cover inequalities for the knapsack polytope
- The (not so) trivial lifting in two dimensions
- Sequence independent lifting of cover inequalities
- Lifting for the integer knapsack cover polyhedron
- Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic
- Sequence Independent Lifting for Mixed-Integer Programming
- New classes of facets for complementarity knapsack problems
- A polyhedral study on chance constrained program with random right-hand side
- Knapsack polytopes: a survey
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
- Valid inequalities for mips and group polyhedra from approximate liftings
- 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
- New classes of facets for complementarity knapsack problems
- Cutting planes for the multistage stochastic unit commitment problem
- Polyhedral results for a class of cardinality constrained submodular minimization problems
- Local cuts for mixed-integer programming
- Sequence Independent Lifting for the Set of Submodular Maximization Problem
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- On lifted cover inequalities: a new lifting procedure with unusual properties
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
- Recycling valid inequalities for robust combinatorial optimization with budgeted uncertainty
- Lifting two-integer knapsack inequalities
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Lifting for mixed integer programs with variable upper bounds
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
- An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- A cutting plane approach for integrated planning and scheduling
- Approximate and exact merging of knapsack constraints with cover inequalities
- Lifting for conic mixed-integer programming
- Cover and pack inequalities for (mixed) integer programming
- Multi-period traffic routing in satellite networks
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- On a generalization of the master cyclic group polyhedron
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- A cut-and-branch algorithm for the quadratic knapsack problem
- A note on valid inequalities for PageRank optimization with edge selection constraints
- Separation algorithms for 0-1 knapsack polytopes
- On the exact separation of mixed integer knapsack cuts
- New valid inequalities for the fixed-charge and single-node flow polytopes
- Flow pack facets of the single node fixed-charge flow polytope
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- Robust network design: formulations, valid inequalities, and computations
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Valid inequalities for separable concave constraints with indicator variables
- Valid inequalities for separable concave constraints with indicator variables
- Cutting planes in integer and mixed integer programming
- Sequence independent lifting for mixed integer programs with variable upper bounds
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- Constrained integer fractional programming problem with box constraints
- Valid inequalities for the -edge disruptor problem
- Risk-averse shortest path interdiction
- Lifting, tilting and fractional programming revisited
- Chance-constrained set covering with Wasserstein ambiguity
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- Maximizing a class of submodular utility functions with constraints
- An effective hybrid approach to the two-stage capacitated facility location problem
- Two-set inequalities for the binary knapsack polyhedra
- Maximizing a class of submodular utility functions
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
- Chance-Constrained Binary Packing Problems
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
This page was built for publication: Sequence independent lifting in mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977865)
