Sensitivity analysis for mixed binary quadratic programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Exact augmented Lagrangian duality for mixed integer linear programming
- Exact augmented Lagrangian duality for mixed integer quadratic programming
- Improving proximity bounds using sparsity
- Improving the Cook et al. proximity bound given integral valued constraints
- Integer Programming
- Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- Proximity in concave integer quadratic programming
- Quadratic programming is in NP
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Sensitivity theorems in integer linear programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Some proximity and sensitivity results in quadratic integer programming
- Testing copositivity via mixed-integer linear programming
Cited in
(2)
This page was built for publication: Sensitivity analysis for mixed binary quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030541)
