Pages that link to "Item:Q1586209"
From MaRDI portal
The following pages link to Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs (Q1586209):
Displayed 50 items.
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
- On the transportation problem with market choice (Q479018) (← links)
- Maximum utility product pricing models and algorithms based on reservation price (Q535296) (← links)
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- Lifting, tilting and fractional programming revisited (Q614041) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Integer-programming software systems (Q817202) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Fixed-charge transportation problems on trees (Q1728231) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- Multi-commodity variable upper bound flow models (Q1751124) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs (Q2061900) (← links)
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
- Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope (Q2183218) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem (Q2253398) (← links)
- New valid inequalities for the fixed-charge and single-node flow polytopes (Q2294335) (← links)
- Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Fixed-charge transportation on a path: optimization, LP formulations and separation (Q2434997) (← links)
- Facets for the single node fixed-charge network set with a node set-up variable (Q2448216) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Fixed-Charge Transportation on a Path: Linear Programming Formulations (Q3009780) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- Valid Inequalities for Separable Concave Constraints with Indicator Variables (Q3186509) (← links)
- Towards optimal formwork pairing on construction sites (Q3515391) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem (Q5355207) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)