scientific article; zbMATH DE number 3545380
From MaRDI portal
zbMath0349.90117MaRDI QIDQ4120330
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A branch and bound algorithm for extreme point mathematical programming problems, Facet inequalities from simple disjunctions in cutting plane theory, Representability in mixed integer programming. I: Characterization results, Duality for mixed-integer convex minimization, On the redundancy of cutting planes for linear complementarity problems, Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems, Ideal, non-extended formulations for disjunctive constraints admitting a network representation, A finite procedure to generate feasible points for the extreme point mathematical programming problem, A simplification for some disjunctive formulations, Assembly planning by disjunctive programming and geometrical reasoning, Strengthening cuts for mixed integer programs, Fenchel decomposition for stochastic mixed-integer programming, Modeling combinatorial disjunctive constraints via junction trees, Tightening simple mixed-integer sets with guaranteed bounds, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, A finitely convergent procedure for facial disjunctive programs, A note on the split rank of intersection cuts, Mixed logical-linear programming, Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs, Approximate formulations for 0-1 knapsack sets, Integer programs for logic constraint satisfaction, Intermediate integer programming representations using value disjunctions, Relaxations for probabilistically constrained programs with discrete random variables, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, RLT: A unified approach for discrete and continuous nonconvex optimization, Optimality conditions for disjunctive optimization in reflexive Banach spaces, Elementary closures for integer programs., Application of disjunctive programming to the linear complementarity problem, A note on duality in disjunctive programming, A converse for disjunctive constraints, Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables, Minimal inequalities, Testing cut generators for mixed-integer linear programming, On the generation of deep disjunctive cutting planes, Two mixed integer programming formulations arising in manufacturing management, A recursive procedure to generate all cuts for 0-1 mixed integer programs, A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions, Future paths for integer programming and links to artificial intelligence, Disjunctive programming: Properties of the convex hull of feasible points, Representability of functions
