Enumerative inequalities in integer programming

DOI10.1007/BF01584536zbMath0251.90030MaRDI QIDQ5665019

C. A. Burdet

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Integer programming and convex analysis: Intersection cuts from outer polars

Cites Work

• Unnamed Item
• A duality theorem and an algorithm for (mixed-) integer nonlinear programming
• An Automatic Method of Solving Discrete Programming Problems
• A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables
• Sur les inégalités linéaires
• Integer Programming by Implicit Enumeration and Balas’ Method
• Some continuous functions related to corner polyhedra
• Cut search methods in integer programming
• Convexity Cuts and Cut Search