scientific article; zbMATH DE number 3545380
From MaRDI portal
Publication:4120330
zbMATH Open0349.90117MaRDI QIDQ4120330FDOQ4120330
Authors: E. Balas 
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (40)
- Testing cut generators for mixed-integer linear programming
- A note on duality in disjunctive programming
- A converse for disjunctive constraints
- RLT: A unified approach for discrete and continuous nonconvex optimization
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Minimal inequalities
- Two mixed integer programming formulations arising in manufacturing management
- A finitely convergent procedure for facial disjunctive programs
- Representability in mixed integer programming. I: Characterization results
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- Strengthening cuts for mixed integer programs
- Future paths for integer programming and links to artificial intelligence
- A note on the split rank of intersection cuts
- Tightening simple mixed-integer sets with guaranteed bounds
- Facet inequalities from simple disjunctions in cutting plane theory
- Duality for mixed-integer convex minimization
- Representability of functions
- Intermediate integer programming representations using value disjunctions
- Disjunctive programming: Properties of the convex hull of feasible points
- A branch and bound algorithm for extreme point mathematical programming problems
- Approximate formulations for 0-1 knapsack sets
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- Single commodity stochastic network design under probabilistic constraint with discrete random variables
- Elementary closures for integer programs.
- Relaxations for probabilistically constrained programs with discrete random variables
- Optimality conditions for disjunctive optimization in reflexive Banach spaces
- A simplification for some disjunctive formulations
- Integer programs for logic constraint satisfaction
- Assembly planning by disjunctive programming and geometrical reasoning
- Mixed logical-linear programming
- Application of disjunctive programming to the linear complementarity problem
- Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
- On the generation of deep disjunctive cutting planes
- 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
- On the redundancy of cutting planes for linear complementarity problems
- Fenchel decomposition for stochastic mixed-integer programming
- Modeling combinatorial disjunctive constraints via junction trees
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120330)
