Pages that link to "Item:Q2576727"
From MaRDI portal
The following pages link to New approaches for optimizing over the semimetric polytope (Q2576727):
Displaying 14 items.
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- A Lagrangian approach to chance constrained routing with local broadcast (Q2056917) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- Dynamic bundle methods (Q2390994) (← links)
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
