Pages that link to "Item:Q3565248"

The following pages link to The Group-Theoretic Approach in Mixed Integer Programming (Q3565248):

Displaying 19 items.

• Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
• Standard pairs and group relaxations in integer programming (Q1295785) (← links)
• Some cut-generating functions for second-order conic sets (Q1751217) (← links)
• Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
• An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem (Q1785398) (← links)
• Extreme functions with an arbitrary number of slopes (Q1801005) (← links)
• Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem (Q2020605) (← links)
• On the complexity of surrogate and group relaxation for integer linear programs (Q2060595) (← links)
• The strength of multi-row aggregation cuts for sign-pattern integer programs (Q2294249) (← links)
• A geometric approach to cut-generating functions (Q2349120) (← links)
• Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case (Q4637826) (← links)
• Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
• Multiple cost coefficients sensitivity theorems of integer linear optimization (Q5039396) (← links)
• Numerical semigroups, polyhedra, and posets I: the group cone (Q5048457) (← links)
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
• Nonunique Lifting of Integer Variables in Minimal Inequalities (Q5376544) (← links)
• Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276) (← links)
• Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
• Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)