Integer programming as projection

DOI10.1016/j.disopt.2016.08.004zbMath1387.90146OpenAlexW139266831MaRDI QIDQ1751196

H. Paul Williams, John N. Hooker

Publication date: 24 May 2018

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

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.08.004

zbMATH Keywords

integer programmingdualityprojectionvalue function

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications, An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities

Cites Work

• Efficient market-clearing prices in markets with nonconvexities
• Decomposing finitely generated integral monoids by elimination
• Fourier-Motzkin elimination extension to integer programming problems
• Edmonds polytopes and a hierarchy of combinatorial problems
• Integer Programming with a Fixed Number of Variables
• Integer Programming and Pricing
• Fourier's Method of Linear Programming and Its Dual
• The value function of an integer program
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Discrete subadditive functions as Gomory functions
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS