Enumerative inequalities in integer programming

DOI10.1007/BF01584536zbMATH Open0251.90030MaRDI QIDQ5665019FDOQ5665019

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

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

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)