Cyclic group blocking polyhedra

DOI10.1007/s10107-012-0536-9zbMath1274.90239OpenAlexW2007311344MaRDI QIDQ1949270

Ellis L. Johnson, Sang Ho Shim

Publication date: 6 May 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0536-9

zbMATH Keywords

blocking polyhedroncyclic group problemknapsack subadditive polytopeshooting linear problem

Mathematics Subject Classification ID

Related Items (5)

A concise characterization of strong knapsack facets ⋮ A strong formulation for the graph partition problem ⋮ New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem ⋮ A few strong knapsack facets ⋮ The worst case analysis of strong knapsack facets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of finding minimum-length generator sequences
• Corner polyhedra and their connection with cutting planes
• Cyclic group and knapsack facets
• Some polyhedra related to combinatorial problems
• Primal-dual simplex method for shooting
• Dual row modules and polyhedra of blocking group problems
• The minimum-length generator sequence problem is NP-hard
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Some continuous functions related to corner polyhedra, II

This page was built for publication: Cyclic group blocking polyhedra