The following pages link to (Q4889854):
Displaying 8 items.
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation (Q5874493) (← links)
- A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities (Q6050153) (← links)
- Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← links)
- A Unified Framework for Pricing in Nonconvex Resource Allocation Games (Q6114782) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem (Q6166100) (← links)
- Optimization of the optimal value function in problems of convex parametric programming (Q6194911) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
