Some remarks on quadratic programming with 0-1 variables
R.I.R.O., 4 V3 (1970) 67-79
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
An exact cutting plane method for the Euclidean max-sum diversity problem
Sandy Spiers, Hoa T. Bui and Ryan LoxtonEuropean Journal of Operational Research 311 (2) 444 (2023)
https://doi.org/10.1016/j.ejor.2023.05.014
A Distributed Algorithm for Controlling Continuous and Discrete Variables in a Radial Distribution Grid
Jonatan Ralf Axel Klemets and Merkebu Zenebe DegefaIEEE Access 11 2488 (2023)
https://doi.org/10.1109/ACCESS.2023.3234102
1 (2023)
https://doi.org/10.1007/978-3-030-54621-2_853-1
Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
Xiaojin Zheng and Zhongyi JiangJournal of Industrial & Management Optimization 17 (5) 2331 (2021)
https://doi.org/10.3934/jimo.2020071
Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
Rupaj Kumar Nayak and Nirmalya Kumar MohantyJournal of Combinatorial Optimization 39 (3) 792 (2020)
https://doi.org/10.1007/s10878-019-00517-8
Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
Xiaojin Zheng, Yutong Pan and Xueting CuiJournal of Global Optimization 70 (4) 719 (2018)
https://doi.org/10.1007/s10898-017-0591-0
A binarisation heuristic for non-convex quadratic programming with box constraints
Laura Galli and Adam N. LetchfordOperations Research Letters 46 (5) 529 (2018)
https://doi.org/10.1016/j.orl.2018.08.005
1509 (2018)
https://doi.org/10.1109/CVPRW.2018.00192
The min-cut and vertex separator problem
Fanz Rendl and Renata SotirovComputational Optimization and Applications 69 (1) 159 (2018)
https://doi.org/10.1007/s10589-017-9943-4
The demand weighted vehicle routing problem
Jeffrey D. Camm, Michael J. Magazine, Saravanan Kuppusamy and Kipp MartinEuropean Journal of Operational Research 262 (1) 151 (2017)
https://doi.org/10.1016/j.ejor.2017.03.033
Optimization and Control for Systems in the Big-Data Era
Baiyi Wu and Rujun JiangInternational Series in Operations Research & Management Science, Optimization and Control for Systems in the Big-Data Era 252 43 (2017)
https://doi.org/10.1007/978-3-319-53518-0_4
A model for clustering data from heterogeneous dissimilarities
Éverton Santi, Daniel Aloise and Simon J. BlanchardEuropean Journal of Operational Research 253 (3) 659 (2016)
https://doi.org/10.1016/j.ejor.2016.03.033
Modeling and Optimization: Theory and Applications
Hongbo Dong and Nathan KrislockSpringer Proceedings in Mathematics & Statistics, Modeling and Optimization: Theory and Applications 147 49 (2015)
https://doi.org/10.1007/978-3-319-23699-5_3
A compact variant of the QCR method for quadratically constrained quadratic 0–1 programs
Laura Galli and Adam N. LetchfordOptimization Letters 8 (4) 1213 (2014)
https://doi.org/10.1007/s11590-013-0676-8
Modeling, Simulation and Optimization of Complex Processes
Ralf Borndörfer and Carlos CardonhaModeling, Simulation and Optimization of Complex Processes 41 (2012)
https://doi.org/10.1007/978-3-642-25707-0_4
Combining QCR and CHR for convex quadratic pure 0–1 programming problems with linear constraints
Aykut Ahlatçıoğlu, Michael Bussieck, Mustafa Esen, et al.Annals of Operations Research 199 (1) 33 (2012)
https://doi.org/10.1007/s10479-011-0969-1
Extending the QCR method to general mixed-integer programs
Alain Billionnet, Sourour Elloumi and Amélie LambertMathematical Programming 131 (1-2) 381 (2012)
https://doi.org/10.1007/s10107-010-0381-7
Non-convex mixed-integer nonlinear programming: A survey
Samuel Burer and Adam N. LetchfordSurveys in Operations Research and Management Science 17 (2) 97 (2012)
https://doi.org/10.1016/j.sorms.2012.08.001
Spectral bounds for unconstrained (−1,1)-quadratic optimization problems
Walid Ben-Ameur and José NetoEuropean Journal of Operational Research 207 (1) 15 (2010)
https://doi.org/10.1016/j.ejor.2010.02.042
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
Alain Billionnet, Sourour Elloumi and Marie-Christine PlateauDiscrete Applied Mathematics 157 (6) 1185 (2009)
https://doi.org/10.1016/j.dam.2007.12.007
Operations Research Proceedings 2006
Harvey J. GreenbergOperations Research Proceedings, Operations Research Proceedings 2006 2006 83 (2007)
https://doi.org/10.1007/978-3-540-69995-8_14
Ranking in quadratic integer programming problems
Renu Gupta, Lakshmisree Bandopadhyaya and M.C. PuriEuropean Journal of Operational Research 95 (1) 231 (1996)
https://doi.org/10.1016/0377-2217(95)00245-6
The indefinite zero-one quadratic problem
Michael W. CarterDiscrete Applied Mathematics 7 (1) 23 (1984)
https://doi.org/10.1016/0166-218X(84)90111-2
Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver
Pierre HansenAnnals of Discrete Mathematics, Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver 5 53 (1979)
https://doi.org/10.1016/S0167-5060(08)70343-1
Résolution d'un programme quadratique en variantes bivalentes par décomposition application au placement de commutateurs dans un réseau
A. Henry-LabordèreRAIRO - Operations Research 13 (1) 23 (1979)
https://doi.org/10.1051/ro/1979130100231
Optimization Techniques Modeling and Optimization in the Service of Man Part 2
C. SaguezLecture Notes in Computer Science, Optimization Techniques Modeling and Optimization in the Service of Man Part 2 41 219 (1976)
https://doi.org/10.1007/3-540-07623-9_289
Applications of Number Theory to Numerical Analysis
PETER L. HAMMER and IVO G. ROSENBERGApplications of Number Theory to Numerical Analysis 453 (1972)
https://doi.org/10.1016/B978-0-12-775950-0.50021-2
Une méthode de résolution des programmes non-linéaire partiellement discrets sans hypothèse de convexité
J. AbadieRevue française d'informatique et de recherche opérationnelle. Série verte 5 (V1) 23 (1971)
https://doi.org/10.1051/ro/197105V100231