The following pages link to Marco Locatelli (Q166220):
Displaying 13 items.
- Fast global optimization of difficult Lennard-Jones clusters (Q5960291) (← links)
- Solution Algorithms for the Bounded Acceleration Shortest Path Problem (Q6055295) (← links)
- KKT-based primal-dual exactness conditions for the Shor relaxation (Q6104908) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem (Q6161303) (← links)
- Tool switching problems with tool order constraints (Q6202949) (← links)
- Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints (Q6417467) (← links)
- A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools (Q6492453) (← links)
- Local Optimization of MAPF solutions on Directed Graphs (Q6509503) (← links)
- Identification of Cyclists' Route Choice Criteria (Q6527531) (← links)
- Constrained motion planning and multi-agent path finding on directed graphs (Q6566732) (← links)
- Is time-optimal speed planning under jerk constraints a convex problem? (Q6605997) (← links)