Pages that link to "Item:Q1924056"
From MaRDI portal
The following pages link to A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056):
Displayed 8 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
- A simple version of bundle method with linear programming (Q2419511) (← links)
- Interior point stabilization for column generation (Q2465956) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)