Cutting-plane theory: Algebraic methods

DOI10.1016/0012-365X(78)90112-7zbMath0406.90055OpenAlexW2080875922MaRDI QIDQ1257827

Robert G. Jeroslow

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0012-365x(78)90112-7

zbMATH Keywords

DualitySurveyAlgebraic ApproachCutting PlanesLinear Integer ProgrammingPolarity For Polyhedra

Mathematics Subject Classification ID

Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Applications of graph theory to circuits and networks (94C15)

Related Items

Duality for mixed-integer convex minimization, On sublinear inequalities for mixed integer conic programs, Theoretical challenges towards cutting-plane selection, A unified approach for price directive decomposition procedures in integer programming, Additively separable duality theory, A closed-form representation of mixed-integer program value functions, Continuous cutting plane algorithms in integer programming, The b-hull of an integer program, Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm, Minimal inequalities, A recursive procedure to generate all cuts for 0-1 mixed integer programs, Integer programming duality: Price functions and sensitivity analysis, An elementary survey of general duality theory in mathematical programming, L-shaped decomposition of two-stage stochastic programs with integer recourse, Alternative group relaxation of integer programming problems, A framework for generalized Benders' decomposition and its application to multilevel optimization, The value function of an integer program, Constructive characterizations of the value-function of a mixed-integer program. I, A primal dual integer programming algorithm, On abstract duality in mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strengthening cuts for mixed integer programs
• The value function of a mixed integer program: I
• Some polyhedra related to combinatorial problems
• Edmonds polytopes and a hierarchy of combinatorial problems
• Linear homogeneous Diophantine equations and magic labelings of graphs
• Minimal inequalities
• On the existence of optimal solutions to integer and mixed-integer programming problems
• Constructive Duality in Integer Programming
• Experimental results on Hillier's linear search
• Constructive Group Relaxations for Integer Programs
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• FACES OF AN INTEGER POLYHEDRON
• Generalized Lagrange Multipliers in Integer Programming
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems
• Group-Theoretic Results in Mixed Integer Programming
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Some continuous functions related to corner polyhedra, II
• Technical Note—Rationalizing Discrete Programs
• Contributions to the Theory of Games (AM-24), Volume I