Pages that link to "Item:Q506439"
From MaRDI portal
The following pages link to Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439):
Displaying 6 items.
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints (Q1753130) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
