Pages that link to "Item:Q1017675"

The following pages link to Convex integer maximization via Graver bases (Q1017675):

Displaying 9 items.

• Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
• \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
• The power of pyramid decomposition in Normaliz (Q898277) (← links)
• Efficient solutions for weight-balanced partitioning problems (Q1751164) (← links)
• The quadratic Graver cone, quadratic integer minimization, and extensions (Q1925790) (← links)
• \(n\)-fold integer programming in cubic time (Q1942262) (← links)
• Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
• Convex integer optimization by constantly many linear counterparts (Q2451653) (← links)
• Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube (Q6155880) (← links)