A primal dual integer programming algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3578640 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3431974 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- An Introduction to the Theory of Cutting-Planes
- Computational Complexity of Some Problems in Parametric Discrete Programming. I
- Cutting-plane theory: Algebraic methods
- Edmonds polytopes and a hierarchy of combinatorial problems
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- Integer programming duality: Price functions and sensitivity analysis
- Odd Minimum Cut-Sets and b-Matchings
- On Cutting Planes
- On the Group Problem and a Subadditive Approach to Integer Programming
- Outline of an algorithm for integer solutions to linear programs
- Paths, Trees, and Flowers
- The b-hull of an integer program
- The value function of a mixed integer program: I
- The value function of an integer program
Cited in
(9)- Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm
- The primal-dual method for approximation algorithms
- The primal-dual algorithm as a constraint-set-manipulation device
- Primal integer programming
- A Gilmore-Gomory construction of integer programming value functions
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- scientific article; zbMATH DE number 5371762 (Why is no real title available?)
- Solution approaches for highly primal- and dual-degenerate all-integer programming problems
- Subadditive approaches in integer programming
This page was built for publication: A primal dual integer programming algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309813)