Pages that link to "Item:Q700752"
From MaRDI portal
The following pages link to New bundle methods for solving Lagrangian relaxation dual problems (Q700752):
Displaying 10 items.
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach (Q890005) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid (Q2030326) (← links)
- The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems (Q2162511) (← links)
- Dynamic bundle methods (Q2390994) (← links)
- Solving dual problems using a coevolutionary optimization algorithm (Q2434646) (← links)
- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems (Q2442700) (← links)
