A number theoretic reformulation and decomposition method for integer programming

DOI10.1016/0012-365X(74)90046-6zbMath0277.90052MaRDI QIDQ1394028

Laurence A. Wolsey

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (1)

Extended formulations for Gomory corner polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Transformation of integer programs to knapsack problems
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
• Equivalent Integer Programs and Canonical Problems
• Extensions of the Group Theoretic Approach in Integer Programming
• Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
• Generalized dynamic programming methods in integer programming

This page was built for publication: A number theoretic reformulation and decomposition method for integer programming