The following pages link to (Q4120330):
Displaying 40 items.
- Duality for mixed-integer convex minimization (Q304264) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
- Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (Q934793) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
- A simplification for some disjunctive formulations (Q1104856) (← links)
- Strengthening cuts for mixed integer programs (Q1142702) (← links)
- A finitely convergent procedure for facial disjunctive programs (Q1159568) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- Relaxations for probabilistically constrained programs with discrete random variables (Q1197883) (← links)
- A note on duality in disjunctive programming (Q1229803) (← links)
- A converse for disjunctive constraints (Q1238749) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- Disjunctive programming: Properties of the convex hull of feasible points (Q1281382) (← links)
- A recursive procedure to generate all cuts for 0-1 mixed integer programs (Q1813832) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- Representability of functions (Q1825755) (← links)
- Fenchel decomposition for stochastic mixed-integer programming (Q1937960) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- Optimality conditions for disjunctive optimization in reflexive Banach spaces (Q2260683) (← links)
- Assembly planning by disjunctive programming and geometrical reasoning (Q2669707) (← links)
- Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables (Q2797468) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- Facet inequalities from simple disjunctions in cutting plane theory (Q3707764) (← links)
- On the redundancy of cutting planes for linear complementarity problems (Q3716850) (← links)
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274) (← links)
- Minimal inequalities (Q3879045) (← links)
- On the generation of deep disjunctive cutting planes (Q3885524) (← links)
- Application of disjunctive programming to the linear complementarity problem (Q5184695) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
- Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)
