Fetching the paper…
Reading the bibliography…
We consider sensitivity analysis for Mixed Binary Quadratic Programs (MBQPs) with respect to changing right-hand-sides (rhs).
Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Naval Research Logistics Quarterly 9
1962
Earlier work this paper cites.
Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret analiz 3
1964
Earlier work this paper cites.
McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part i—convex underestimating problems. Mathematical programming 10
1976
Earlier work this paper cites.
Holyer, I.: The NP
1981
Earlier work this paper cites.
Cook, W., Gerards, A.M.H., Schrijver, A., Tardos, É.: Sensitivity theorems in integer linear programming. Mathematical Programming 34
1986
Earlier work this paper cites.
Shor, N.Z.: Quadratic optimization problems. Soviet Journal of Computer and Systems Sciences 25
1987
Earlier work this paper cites.
Granot, F., Skorin-Kapov, J.: Some proximity and sensitivity results in quadratic integer programming. Mathematical Programming 47
1990
Earlier work this paper cites.
Vavasis, S.A.: Quadratic programming is in NP
1990
Earlier work this paper cites.
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization vol. 55. John Wiley & Sons, Hoboken (1999)
1999
Earlier work this paper cites.
Bomze, I.M., De Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. Journal of Global Optimization 24
2002
Earlier work this paper cites.
Shahidehpour, M., Yamin, H., Li, Z.: Market Operations in Electric Power Systems: Forecasting, Scheduling, and Risk Management. John Wiley & Sons, New York, USA (2003)
2003
Earlier work this paper cites.
Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem. Mathematical programming 109
2007
Cited alongside, same era.
Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Mathematical Programming 120
2009
Cited alongside, same era.
Burer, S., Dong, H.: Representing quadratically constrained quadratic programs as generalized copositive programs. Operations Research Letters 40
2012
Cited alongside, same era.
Conforti, M., Cornuéjols, G., Zambelli, G.: Integer Programming. Cham Springer International Publishing, Cham, Switzerland (2014)
2014
Cited alongside, same era.
Feizollahi, M.J., Ahmed, S., Sun, A.: Exact augmented lagrangian duality for mixed integer linear programming. Mathematical Programming 161
2017
Cited alongside, same era.
Xavier, Á.S., Qiu, F., Ahmed, S.: Learning to solve large-scale security-constrained unit commitment problems. INFORMS Journal on Computing 33
2021
Later among the works it cites.
2021
Later among the works it cites.
2022
Later among the works it cites.
Del Pia, A., Ma, M.: Proximity in concave integer quadratic programming. Mathematical Programming 194
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the steinitz lemma. ACM Transactions on Algorithms (TALG) 16
2019
Cited alongside, same era.
2020
Cited alongside, same era.
Lee, J., Paat, J., Stallknecht, I., Xu, L.: Improving proximity bounds using sparsity. In: Combinatorial Optimization: 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers 6, pp. 115–127 (2020). Springer
2020
Cited alongside, same era.
Gu, X., Ahmed, S., Dey, S.S.: Exact augmented lagrangian duality for mixed integer quadratic programming. SIAM Journal on Optimization 30
2020
Cited alongside, same era.
Majumdar, A., Hall, G., Ahmadi, A.A.: Recent scalability improvements for semidefinite programming with applications in machine learning, control, and robotics. Annual Review of Control, Robotics, and Autonomous Systems 3
2020
Cited alongside, same era.
Anstreicher, K.M.: Testing copositivity via mixed–integer linear programming. Linear Algebra and its Applications 609
2020
Cited alongside, same era.
Guo, C., Bodur, M., Taylor, J.A.: Copositive duality for discrete energy markets
Cited in the paper.
Celaya, M., Kuhlmann, S., Paat, J., Weismantel, R.: Improving the cook et al. proximity bound given integral valued constraints. In: Integer Programming and Combinatorial Optimization: 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022, Proceedings, Cham, Switzerland, pp. 84–97 (2022). Springer
2022
Later among the works it cites.
2022
Later among the works it cites.
Linderoth, J., Raghunathan, A.: Completely Positive Reformulations and Cutting Plane Algorithms for Mixed Integer Quadratic Programs. INFORMS Annual Meeting (2022)
2022
Later among the works it cites.
Badenbroek, R., Klerk, E.: An analytic center cutting plane method to determine complete positivity of a matrix. INFORMS Journal on Computing 34
2022
Later among the works it cites.
Cifuentes, D., Dey, S.S., Xu, J.: Sensitivity analysis for mixed binary quadratic programming. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 446–459 (2024). Springer
2024
Closest in time.
Klep, I., Štrekelj, T., Zalar, A.: A random copositive matrix is completely positive with positive probability. SIAM Journal on Applied Algebra and Geometry 8
2024
Closest in time.