Pages that link to "Item:Q1141585"
From MaRDI portal
The following pages link to Optimization with disjunctive constraints (Q1141585):
Displaying 50 items.
- A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Note on solving linear complementarity problems as jointly constrained bilinear programs (Q809900) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints (Q857798) (← links)
- On optimality and duality theorems of nonlinear disjunctive fractional minmax programs (Q872111) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← 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)
- A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming (Q949520) (← 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)
- A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
- A simplification for some disjunctive formulations (Q1104856) (← links)
- Quadratic programming problems and related linear complementarity problems (Q1121791) (← links)
- An algorithm for disjunctive programs (Q1173796) (← links)
- A finite algorithm for solving the generalized lattice point problem (Q1179205) (← links)
- Lagrangean duality for facial programs with applications to integer and complementarity problems (Q1196216) (← links)
- Relaxations for probabilistically constrained programs with discrete random variables (Q1197883) (← links)
- Tight bounds for capacities (Q1323610) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Solving linear optimization over arithmetic constraint formula (Q1675635) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- Fenchel decomposition for stochastic mixed-integer programming (Q1937960) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- Optimality conditions for disjunctive optimization in reflexive Banach spaces (Q2260683) (← links)
- Configuration of airspace sectors for balancing air traffic controller workload (Q2393463) (← links)
- On the optimality of nonlinear fractional disjunctive programming problems (Q2519626) (← links)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints (Q2815438) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application (Q3494393) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
- Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
- Facet inequalities from simple disjunctions in cutting plane theory (Q3707764) (← links)
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274) (← links)
- A finite cutting plane method for facial disjunctive programs (Q3971356) (← links)
- Stability in disjunctive optimization II:continuity of the feasible and optimal set (Q4764595) (← links)
- Application of disjunctive programming to the linear complementarity problem (Q5184695) (← links)
- Stability in disjunctive linear optimization I: continuity of the feasible set (Q5750733) (← links)
