Pages that link to "Item:Q687032"
From MaRDI portal
The following pages link to Mixed-integer bilinear programming problems (Q687032):
Displayed 13 items.
- 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)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← 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)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Biconvex Models and Algorithms for Risk Management Problems (Q4842694) (← links)