Pages that link to "Item:Q3703656"
From MaRDI portal
The following pages link to Valid Linear Inequalities for Fixed Charge Problems (Q3703656):
Displaying 41 items.
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- Valid inequalities and separation for capacitated fixed charge flow problems (Q1962074) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers (Q2044966) (← 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)
- 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)
- On optimizing over lift-and-project closures (Q2392660) (← 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)
- Multi-period capacitated location with modular equipments (Q2456628) (← links)
- The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
- Lot sizing with inventory gains (Q2467450) (← links)
- Partitions of a polytope and mappings of a point set to facets (Q2486861) (← links)
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities (Q2487846) (← links)
- Polyhedral description of the integer single node flow set with constant bounds (Q2583130) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- An algorithm for solving fixed-charge problems using surrogate constraints (Q2638935) (← links)
- A polynomial-time algorithm with tight error bounds for single-period unit commitment problem (Q2687676) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Valid Inequalities for the Pooling Problem with Binary Variables (Q3009755) (← links)
- Fixed-Charge Transportation on a Path: Linear Programming Formulations (Q3009780) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q3088089) (← links)
- Valid Inequalities for Separable Concave Constraints with Indicator Variables (Q3186509) (← links)
- Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities (Q3387909) (← links)
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
- Small extended formulation for knapsack cover inequalities from monotone circuits (Q4612478) (← links)
- Discrete equal-capacityp-median problem (Q4949164) (← links)
- Sequence independent lifting of cover inequalities (Q5101436) (← links)
- Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling (Q5129179) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q5346558) (← links)
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem (Q5355207) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- A family of facets for the uncapacitated \(p\)-median polytope (Q5945384) (← links)
- Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)
- Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)
