The following pages link to Manlio Gaudioso (Q480817):
Displaying 29 items.
- A class of manpower scheduling problems (Q4000927) (← links)
- A Heuristic for the Periodic Vehicle Routing Problem (Q4019560) (← links)
- (Q4193263) (← links)
- A multiplier adjustment technique for the capacitated concentrator location problem (Q4227929) (← links)
- (Q4233328) (← links)
- Variants to the cutting plane approach for convex nondifferentiable optimization (Q4327932) (← links)
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization (Q4622889) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control (Q4651967) (← links)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization (Q4673325) (← links)
- (Q4762515) (← links)
- (Q4945409) (← links)
- Deforming $||.||_{1}$ into $||.||_{\infty}$ via Polyhedral Norms: A Pedestrian Approach (Q5094918) (← links)
- Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
- Robust spherical separation (Q5277988) (← links)
- Ellipsoidal separation for classification problems (Q5317749) (← links)
- An Incremental Method for Solving Convex Finite Min-Max Problems (Q5387972) (← links)
- (Q5415303) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Polyhedral separability through successive LP (Q5959910) (← links)
- OMEGA one multi ethnic genetic approach (Q5963233) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
- A Lagrangean relaxation approach to lifetime maximization of directional sensor networks (Q6087140) (← links)
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs (Q6087142) (← links)
- A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization (Q6181363) (← links)
- The descent-ascent algorithm for DC programming (Q6580549) (← links)
- Dual formulation of the sparsity constrained optimization problem: application to classification (Q6585821) (← links)
- Difference of Convex programming in adversarial SVM (Q6593354) (← links)
