Pages that link to "Item:Q4924121"
From MaRDI portal
The following pages link to The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121):
Displayed 12 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
- Virtuous smoothing for global optimization (Q1683327) (← links)
- Routing for unmanned aerial vehicles: touring dimensional sets (Q2076917) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Ordered \(p\)-median problems with neighbourhoods (Q2419559) (← links)
- More Virtuous Smoothing (Q4634104) (← links)