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