Pages that link to "Item:Q5935714"
From MaRDI portal
The following pages link to Concavity cuts for disjoint bilinear programming (Q5935714):
Displaying 18 items.
- Task assignment with controlled and autonomous agents (Q459176) (← links)
- Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem (Q555995) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Cyclic seesaw process for optimization and identification (Q1762401) (← links)
- On proper refinement of Nash equilibria for bimatrix games (Q1941251) (← links)
- An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems (Q2181561) (← links)
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent (Q2195296) (← links)
- A survey of network interdiction models and algorithms (Q2294622) (← links)
- Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming (Q2329684) (← links)
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
- Bilevel optimization applied to strategic pricing in competitive electricity markets (Q2479837) (← links)
- An exact penalty method for weak linear bilevel programming problem (Q2511344) (← links)
- New product introduction against a predator: A bilevel mixed-integer programming approach (Q3655566) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
- Bilevel Programming: The Montreal School (Q6160370) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
