Pages that link to "Item:Q5348475"
From MaRDI portal
The following pages link to Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475):
Displaying 9 items.
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- Strong relaxations for continuous nonlinear programs based on decision diagrams (Q2661626) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)
- A disjunctive cutting plane algorithm for bilinear programming (Q6622752) (← links)
