Pages that link to "Item:Q3496158"

The following pages link to Polyhedral Characterization of Discrete Dynamic Programming (Q3496158):

Displaying 35 items.

• Column generation for extended formulations (Q458128) (← links)
• Some efficiently solvable problems over integer partition polytopes (Q476314) (← links)
• A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
• Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• The mixing set with divisible capacities: a simple approach (Q1043241) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
• Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
• Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
• Fixed-charge transportation problems on trees (Q1728231) (← links)
• Circuit and bond polytopes on series-parallel graphs (Q1751117) (← links)
• Extended formulations for vertex cover (Q1790198) (← links)
• Gainfree Leontief substitution flow problems (Q1802953) (← links)
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
• Packing, partitioning, and covering symresacks (Q2192122) (← links)
• Dynamic programming multi-objective combinatorial optimization (Q2218697) (← links)
• Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
• Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
• Matrices with lexicographically-ordered rows (Q2414107) (← links)
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) (← links)
• On the extension complexity of scheduling polytopes (Q2661503) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Constructing Extended Formulations from Reflection Relations (Q3009770) (← links)
• Scheduling two chains of unit jobs on one machine: A polyhedral study (Q3100690) (← links)
• (Q3386630) (← links)
• Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results (Q4845143) (← links)
• Exact Multiple Sequence Alignment by Synchronized Decision Diagrams (Q4995098) (← links)
• (Q5009500) (← links)
• Facets of the Stochastic Network Flow Problem (Q5124001) (← links)
• Target Cuts from Relaxed Decision Diagrams (Q5138261) (← links)
• Extended formulations in combinatorial optimization (Q5919994) (← links)
• A linear programming based approach to the Steiner tree problem with a fixed number of terminals (Q6068538) (← links)
• A strong formulation for the graph partition problem (Q6068542) (← links)