Pages that link to "Item:Q3430946"
From MaRDI portal
The following pages link to Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946):
Displaying 8 items.
- On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem (Q1711458) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)