Pages that link to "Item:Q3722274"
From MaRDI portal
The following pages link to Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274):
Displayed 50 items.
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
- On the mixing set with a knapsack constraint (Q291057) (← links)
- Duality for mixed-integer convex minimization (Q304264) (← links)
- Supplier selection in the processed food industry under uncertainty (Q322981) (← links)
- Convex hull characterizations of lexicographic orderings (Q330274) (← links)
- Operating room scheduling with generalized disjunctive programming (Q342094) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- Cutting planes from extended LP formulations (Q507316) (← 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)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- On optimality and duality theorems of nonlinear disjunctive fractional minmax programs (Q872111) (← 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)
- Integral polyhedra related to integer multicommodity flows on a cycle (Q968136) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- A compact formulation of the ring loading problem with integer demand splitting (Q1015309) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- On the convex hull of the union of certain polyhedra (Q1115345) (← links)
- An algorithm for disjunctive programs (Q1173796) (← links)
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- A cutting-plane approach to mixed 0-1 stochastic integer programs (Q1278962) (← links)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
- A modified lift-and-project procedure (Q1365045) (← links)
- Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure (Q1600885) (← links)
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming (Q1628043) (← links)
- Computational approaches for mixed integer optimal control problems with indicator constraints (Q1633792) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- Global optimization of MIQCPs with dynamic piecewise relaxations (Q1668791) (← links)
- Solving linear optimization over arithmetic constraint formula (Q1675635) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- Circuit and bond polytopes on series-parallel graphs (Q1751117) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix (Q1958623) (← links)
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling (Q1999390) (← links)
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← links)