Pages that link to "Item:Q3396388"
From MaRDI portal
The following pages link to Branching and bounds tighteningtechniques for non-convex MINLP (Q3396388):
Displaying 18 items.
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)
- Global optimization of mathematical programs with complementarity constraints and application to clean energy deployment (Q5963234) (← links)
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables (Q6043104) (← links)
- A stochastic biomass blending problem in decentralized supply chains (Q6076480) (← links)
- Cycle-based formulations in distance geometry (Q6114894) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Mixed-integer nonlinear and continuous optimization formulations for aircraft conflict avoidance via heading and speed deviations (Q6168498) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023 (Q6544493) (← links)
- A branch-and-bound based globally optimal solution to 2D multi-robot relative pose estimation problems (Q6550249) (← links)
- A Huff-like location model with quality adjustment and/or closing of existing facilities (Q6555174) (← links)
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation (Q6586253) (← links)
- Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching (Q6596338) (← links)
- MIP relaxations in factorable programming (Q6601201) (← links)
- Random projections for semidefinite programming (Q6619767) (← links)
- An Automated Approach to Causal Inference in Discrete Settings (Q6631678) (← links)
- Continuation Newton methods with deflation techniques for global optimization problems (Q6653270) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
