n-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
From MaRDI portal
(Redirected from Publication:896282)
\(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
\(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
Recommendations
- \(N\)-step cycle inequalities: facets for continuous \(n\)-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
- Introduction to algorithms.
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Mingling: mixed-integer rounding with bounds
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- Mixing mixed-integer inequalities
- Negative-cycle detection algorithms
- Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- The Continuous Mixing Polyhedron
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Two-step MIR inequalities for mixed integer programs
- Valid inequalities based on simple mixed-integer sets
- \(N\)-step cycle inequalities: facets for continuous \(n\)-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
Cited in
(11)- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- Valid inequalities and facets for multi‐module survivable network design problem
- Tight second stage formulations in two-stage stochastic mixed integer programs
- Discrete multi-module capacitated lot-sizing problems with multiple items
- Facets for continuous multi-mixing set with general coefficients and bounded integer variables
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- \(N\)-step cycle inequalities: facets for continuous \(n\)-mixing set and strong cuts for multi-module capacitated lot-sizing problem
This page was built for publication: \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896282)
