Pages that link to "Item:Q1586213"

The following pages link to A symmetrical linear maxmin approach to disjoint bilinear programming (Q1586213):

Displayed 29 items.

• An LPCC approach to nonconvex quadratic programs (Q431005) ‎ (← links)
• Task assignment with controlled and autonomous agents (Q459176) ‎ (← links)
• Relaxations and discretizations for the pooling problem (Q513173) ‎ (← 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)
• A simplex approach for finding local solutions of a linear bilevel program by equilibrium points (Q817135) ‎ (← links)
• Bidimensional packing by bilinear programming (Q1016113) ‎ (← links)
• The inverse optimal value problem (Q1769073) ‎ (← links)
• A study of local solutions in linear bilevel programming (Q1781863) ‎ (← links)
• Algorithms for linear programming with linear complementarity constraints (Q1935876) ‎ (← links)
• A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent (Q2195296) ‎ (← links)
• Solving linear programs with complementarity constraints using branch-and-cut (Q2281449) ‎ (← 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)
• Disjunctive cuts for continuous linear bilevel programming (Q2463829) ‎ (← links)
• New branch-and-Cut algorithm for bilevel linear programming (Q2471104) ‎ (← links)
• Bilevel optimization applied to strategic pricing in competitive electricity markets (Q2479837) ‎ (← links)
• Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation (Q2505552) ‎ (← links)
• An exact penalty method for weak linear bilevel programming problem (Q2511344) ‎ (← links)
• APPROXIMATING NASH EQUILIBRIA IN NONZERO-SUM GAMES (Q2701831) ‎ (← links)
• New product introduction against a predator: A bilevel mixed-integer programming approach (Q3655566) ‎ (← links)
• A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) ‎ (← 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)
• A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination (Q6057248) ‎ (← links)
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) ‎ (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) ‎ (← links)
• Bilevel Programming: The Montreal School (Q6160370) ‎ (← links)
• An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) ‎ (← links)