Minimal inequalities
From MaRDI portal
Publication:3879045
DOI10.1007/BF01588222zbMath0437.90063OpenAlexW4245545442MaRDI QIDQ3879045
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588222
Related Items
Duality for mixed-integer convex minimization, On sublinear inequalities for mixed integer conic programs, Theoretical challenges towards cutting-plane selection, A shadow price in integer programming for management decision, The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides, Marginal values in mixed integer linear programming, Evaluating mixed-integer programming models over multiple right-hand sides, Continuous cutting plane algorithms in integer programming, The b-hull of an integer program, A characterization of minimal valid inequalities for mixed integer programs, Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions, Some cut-generating functions for second-order conic sets, Subadditive duality in multiobjective integer linear programming, Minimal inequalities for mixed integer programs, On Minimal Valid Inequalities for Mixed Integer Conic Programs, Cutting-plane theory: Algebraic methods, Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations, Integer programming duality: Price functions and sensitivity analysis, Cut-Generating Functions for Integer Variables, An elementary survey of general duality theory in mathematical programming, 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, Constructive characterizations of the value function of a mixed-integer program. II
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On defining sets of vertices of the hypercube by linear inequalities
- The value function of a mixed integer program: I
- Minimal inequalities for mixed integer programs
- Cutting-plane theory: Algebraic methods
- The value function of a mixed integer program. II
- Some polyhedra related to combinatorial problems
- Polyhedral annexation in mixed integer and combinatorial programming
- Disjunctive Programming
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Some continuous functions related to corner polyhedra
