Pages that link to "Item:Q1201905"

The following pages link to A new reformulation-linearization technique for bilinear programming problems (Q1201905):

Displaying 50 items.

• AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185) (← links)
• Collaborative vehicle-drone distribution network optimization for perishable products in the epidemic situation (Q2108129) (← links)
• Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← 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)
• Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems (Q2250082) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
• A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
• Optimal influenza vaccine distribution with equity (Q2286989) (← links)
• Probability chains: a general linearization technique for modeling reliability in facility location and related problems (Q2355918) (← links)
• Natural gas production network infrastructure development under uncertainty (Q2358131) (← links)
• Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
• Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information (Q2449369) (← links)
• Extremal problems for convex polygons (Q2460117) (← links)
• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
• Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301) (← links)
• Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006) (← links)
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101) (← links)
• Linearity embedded in nonconvex programs (Q2583177) (← links)
• Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach (Q2630216) (← links)
• Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
• A multi-objective approach for PH-graphs with applications to stochastic shortest paths (Q2661758) (← links)
• Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
• DC Programming Approaches for BMI and QMI Feasibility Problems (Q3192953) (← links)
• Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
• A new Lagrangian dual global optimization algorithm for solving bilinear matrix inequalities (Q4498100) (← links)
• Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
• Reduction constraints for the global optimization of NLPs (Q4654430) (← links)
• Biconvex Models and Algorithms for Risk Management Problems (Q4842694) (← links)
• (Q4945105) (← links)
• Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
• The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm (Q4995073) (← links)
• Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
• Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
• Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management (Q5085483) (← links)
• The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
• Optimal Design for Multi-Item Auctions: A Robust Optimization Approach (Q5247609) (← links)
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
• Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
• Global optimization of general non-convex problems with intermediate bilinear substructures (Q5746708) (← links)
• COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
• Mathematical programming formulations for the alternating current optimal power flow problem (Q5918268) (← links)
• Mathematical programming formulations for the alternating current optimal power flow problem (Q5918757) (← links)
• A global supply chain model with transfer pricing and transportation cost allocation (Q5925942) (← links)
• Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem (Q5939945) (← links)
• The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
• A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information (Q6091866) (← links)
• A potential practical algorithm for minimizing the sum of affine fractional functions (Q6106325) (← links)
• Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides (Q6145049) (← links)