Polyhedral Characterization of Discrete Dynamic Programming
From MaRDI portal
acyclic graphsdirected hypergraphhyperflowmultiechelon lot sizingpolyhedral descriptionrecursive computationsshortest path
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Inventory, storage, reservoirs (90B05) Production models (90B30) Linear programming (90C05) Boolean programming (90C09) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
Cited in
(40)- The mixing set with divisible capacities: a simple approach
- Strong formulations for mixed integer programming: A survey
- Expressing combinatorial optimization problems by linear programs
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Fixed-charge transportation problems on trees
- Circuit and bond polytopes on series-parallel graphs
- Extended formulations for vertex cover
- Gainfree Leontief substitution flow problems
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
- Packing, partitioning, and covering symresacks
- Dynamic programming multi-objective combinatorial optimization
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Matrices with lexicographically-ordered rows
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
- On the extension complexity of scheduling polytopes
- Mixed integer linear programming formulation techniques
- Constructing extended formulations from reflection relations
- Scheduling two chains of unit jobs on one machine: a polyhedral study
- Extension complexity, MSO logic, and treewidth
- scientific article; zbMATH DE number 4023017 (Why is no real title available?)
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
- Column generation for extended formulations
- Some efficiently solvable problems over integer partition polytopes
- Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results
- Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
- Survivable network design for group connectivity in low-treewidth graphs
- Facets of the stochastic network flow problem
- Target cuts from relaxed decision diagrams
- A complete characterization of jump inequalities for the hop-constrained shortest path problem
- Extended formulations in combinatorial optimization
- A linear programming based approach to the Steiner tree problem with a fixed number of terminals
- A strong formulation for the graph partition problem
- A polyhedral perspective on tropical convolutions
- Last fifty years of integer linear programming: a focus on recent practical advances
- Mathematical models based on decision hypergraphs for designing a storage cabinet
- Characterization of facets of the hop constrained chain polytope via dynamic programming
- Knapsack polytopes: a survey
This page was built for publication: Polyhedral Characterization of Discrete Dynamic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496158)
