Enumerative inequalities in integer programming

DOI10.1007/BF01584536MaRDI QIDQ5665019zbMATH OpenFDO

Authors C. A. Burdet

Publication date 1972

Published in Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables
• A duality theorem and an algorithm for (mixed-) integer nonlinear programming
• An Automatic Method of Solving Discrete Programming Problems
• Convexity Cuts and Cut Search
• Cut search methods in integer programming
• Integer Programming by Implicit Enumeration and Balas’ Method
• Some continuous functions related to corner polyhedra
• Sur les inégalités linéaires

Cited in

(1)

• Integer programming and convex analysis: Intersection cuts from outer polars

This page was built for publication: Enumerative inequalities in integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5665019)