Pages that link to "Item:Q2282539"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539):
Displaying 9 items.
- Maximal quadratic-free sets (Q2118125) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty (Q2189937) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Topology optimization of adaptive structures: new limits of material economy (Q6125466) (← links)
- Nonlinear model predictive control to automatic train regulation of metro system: an exact solution for embedded applications (Q6491108) (← links)
