Pages that link to "Item:Q2492707"
From MaRDI portal
The following pages link to A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707):
Displaying 5 items.
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- A constraint generation approach for two-machine shop problems with jobs selection (Q1751902) (← links)
- Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm (Q2283932) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)