Pages that link to "Item:Q1273420"
From MaRDI portal
The following pages link to On improvements to the analytic center cutting plane method (Q1273420):
Displaying 15 items.
- About Lagrangian methods in integer optimization (Q817183) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- Shallow, deep and very deep cuts in the analytic center cutting plane method. (Q1572672) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
- An effective line search for the subgradient method (Q1781859) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- A decomposition method for solving multicommodity network equilibria (Q2670467) (← links)
- Multiple cuts in the analytic center cutting plane method (Q2706328) (← links)
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
