Valid Linear Inequalities for Fixed Charge Problems
From MaRDI portal
Recommendations
- Valid inequalities and separation for uncapacitated fixed charge networks
- Fixed-charge transportation problem: facets of the projection polyhedron
- Flow pack facets of the single node fixed-charge flow polytope
- Valid inequalities and separation for capacitated fixed charge flow problems
- scientific article; zbMATH DE number 4045479
Cited in
(94)- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
- Valid inequalities and separation for uncapacitated fixed charge networks
- Valid inequalities for mixed 0-1 programs
- Valid inequalities and separation for capacitated economic lot sizing
- Strong formulations for mixed integer programming: A survey
- Two mixed integer programming formulations arising in manufacturing management
- Valid inequalities and facets of the capacitated plant location problem
- The teacher assignment problem: A special case of the fixed charge transportation problem
- Capacitated facility location: Separation algorithms and computational experience
- A set covering reformulation of the pure fixed charge transportation problem
- The complementary class of generalized flow cover inequalities
- Lexicographical characterization of the faces of convex sets
- New modeling approaches for the design of local access transport area networks
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Theoretical challenges towards cutting-plane selection
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Fixed-charge transportation problems on trees
- Valid inequalities for the single arc design problem with set-ups
- Multi-commodity variable upper bound flow models
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
- Convex hull results for the warehouse problem
- A cutting plane approach for integrated planning and scheduling
- Valid inequalities for separable concave constraints with indicator variables
- Cutting-plane proofs in polynomial space
- Facets and algorithms for capacitated lot sizing
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
- On the facets of the simple plant location packing polytope
- Valid inequalities and separation for capacitated fixed charge flow problems
- Convex hull results for generalizations of the constant capacity single node flow set
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
- 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
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- New valid inequalities for the fixed-charge and single-node flow polytopes
- Lifting for mixed integer programs with variable upper bounds
- On optimizing over lift-and-project closures
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- Facets for the single node fixed-charge network set with a node set-up variable
- Multi-period capacitated location with modular equipments
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- Lot sizing with inventory gains
- Partitions of a polytope and mappings of a point set to facets
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- Polyhedral description of the integer single node flow set with constant bounds
- Sequence independent lifting for mixed integer programs with variable upper bounds
- An algorithm for solving fixed-charge problems using surrogate constraints
- A polynomial-time algorithm with tight error bounds for single-period unit commitment problem
- LS-LIB: a library of tools for solving production planning problems
- Valid Inequalities for the Pooling Problem with Binary Variables
- Fixed-charge transportation on a path: linear programming formulations
- On cut-based inequalities for capacitated network design polyhedra
- A primal-dual approximation algorithm for min-sum single-machine scheduling problems
- Valid inequalities for separable concave constraints with indicator variables
- Lifted Euclidean inequalities for the integer single node flow set with upper bounds
- Constant approximation algorithm for nonuniform capacitated multi-item lot sizing via strong covering inequalities
- scientific article; zbMATH DE number 4045479 (Why is no real title available?)
- Tightening simple mixed-integer sets with guaranteed bounds
- Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
- Small extended formulation for knapsack cover inequalities from monotone circuits
- Fixed-charge transportation problem: facets of the projection polyhedron
- On the transportation problem with market choice
- Discrete equal-capacityp-median problem
- Sequence independent lifting of cover inequalities
- Network models with unsplittable node flows with application to unit train scheduling
- A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
- Maximum utility product pricing models and algorithms based on reservation price
- Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Classical cuts for mixed-integer programming and branch-and-cut
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- A family of facets for the uncapacitated \(p\)-median polytope
- Flow pack facets of the single node fixed-charge flow polytope
- Supermodularity and valid inequalities for quadratic optimization with indicators
- LP-based approximation algorithms for capacitated facility location
- Generalized coefficient strengthening cuts for mixed integer programming
- The convex hull of two core capacitated network design problems
- Cutting planes in integer and mixed integer programming
- Last fifty years of integer linear programming: a focus on recent practical advances
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- SCIP: solving constraint integer programs
- Primal-dual schema for capacitated covering problems
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Fixed charge problems with identical fixed charges
- Integer-programming software systems
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Polyhedral results on single node variable upper-bound flow models with allowed configurations
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- Chvátal closures for mixed integer programming problems
- Compact formulations as a union of polyhedra
- Box-constrained quadratic programs with fixed charge variables
- Nonconvex, lower semicontinuous piecewise linear optimization
This page was built for publication: Valid Linear Inequalities for Fixed Charge Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703656)
