Pages that link to "Item:Q1804882"

The following pages link to Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation (Q1804882):

Displaying 24 items.

• Continuous knapsack sets with divisible capacities (Q263180) (← links)
• A polynomial-time algorithm for knapsack with divisible item sizes (Q287072) (← links)
• Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
• Motion planning with pulley, rope, and baskets (Q385498) (← links)
• On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets (Q427901) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
• Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Lifting two-integer knapsack inequalities (Q868448) (← links)
• Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
• Compact formulations as a union of polyhedra (Q927156) (← links)
• The mixing-MIR set with divisible capacities (Q930344) (← links)
• A polynomial algorithm for the multiple knapsack problem with divisible item sizes (Q987829) (← links)
• Cutting planes for integer programs with general integer variables (Q1290616) (← links)
• Optimal placement of add/drop multiplexers: Static and dynamic models (Q1295992) (← links)
• On variations of the subset sum problem (Q1382248) (← links)
• Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← links)
• A well-solvable special case of the bounded knapsack problem (Q2275577) (← links)
• Manufacturer's mixed pallet design problem (Q2462174) (← links)
• Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
• Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
• A new upper bound for the multiple knapsack problem (Q2668625) (← links)
• Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)