Pages that link to "Item:Q687032"

The following pages link to Mixed-integer bilinear programming problems (Q687032):

Displaying 37 items.

• Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
• SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression (Q319716) (← links)
• Scheduling under linear constraints (Q323163) (← links)
• A multivariate adaptive regression splines cutting plane approach for solving a two-stage stochastic programming fleet assignment model (Q421728) (← links)
• Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
• RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
• DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
• On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
• A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
• A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
• Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem (Q1327241) (← links)
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
• Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
• Tighter representations for set partitioning problems (Q1917353) (← links)
• Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
• Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
• Discretization and global optimization for mixed integer bilinear programming (Q2089882) (← links)
• Generation expansion planning with revenue adequacy constraints (Q2146998) (← links)
• RLT insights into lift-and-project closures (Q2257076) (← links)
• A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
• Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
• Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs (Q2564623) (← links)
• An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
• Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
• Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
• Biconvex Models and Algorithms for Risk Management Problems (Q4842694) (← links)
• Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs (Q4994984) (← links)
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
• Characterizing linearizable QAPs by the level-1 reformulation-linearization technique (Q6122081) (← links)
• An LP-based characterization of solvable QAP instances with chess-board and graded structures (Q6168180) (← links)
• LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q6589750) (← links)
• Enabling research through the SCIP Optimization Suite 8.0 (Q6601379) (← links)
• A disjunctive cutting plane algorithm for bilinear programming (Q6622752) (← links)
• Short paper -- The binary linearization complexity of pseudo-Boolean functions (Q6633276) (← links)