Pages that link to "Item:Q1968795"
From MaRDI portal
The following pages link to A branch-and-cut method for 0-1 mixed convex programming (Q1968795):
Displaying 8 items.
- A computational study of perspective cuts (Q6062884) (← links)
- Shapes and recession cones in mixed-integer convex representability (Q6120855) (← links)
- Service center location problems with decision dependent utilities and a pandemic case study (Q6150220) (← links)
- Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)
- Outer approximation for pseudo-convex mixed-integer nonlinear program problems (Q6494309) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
- A disjunctive cutting plane algorithm for bilinear programming (Q6622752) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)