Pages that link to "Item:Q5712472"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712472):
Displaying 4 items.
- An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)