Brèves communications. 0-1 optimization and non-linear programming
R.A.I.R.O. Recherche opérationnelle, 6 V2 (1972) 95-97
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):
New advances for quantum‐inspired optimization
Yu Du, Haibo Wang, Rick Hennig, Amit Hulandageri, Gary Kochenberger and Fred GloverInternational Transactions in Operational Research 32 (1) 6 (2025)
https://doi.org/10.1111/itor.13420
A Probabilistic Reformulation Technique for Discrete RIS Optimization in Wireless Systems
Anish Pradhan and Harpreet S. DhillonIEEE Transactions on Wireless Communications 23 (6) 5377 (2024)
https://doi.org/10.1109/TWC.2023.3326091
The fundamental theorem of linear programming: extensions and applications
F. TardellaOptimization 60 (1-2) 283 (2011)
https://doi.org/10.1080/02331934.2010.506535
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
Christoph Buchheim and Giovanni RinaldiSIAM Journal on Optimization 18 (4) 1398 (2008)
https://doi.org/10.1137/050646500
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
Endre Boros, Peter L. Hammer and Gabriel TavaresJournal of Heuristics 13 (2) 99 (2007)
https://doi.org/10.1007/s10732-007-9009-3
A polyhedral study of nonconvex quadratic programs with box constraints
Dieter Vandenbussche and George L. NemhauserMathematical Programming 102 (3) 531 (2005)
https://doi.org/10.1007/s10107-004-0549-0
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
Gary A. Kochenberger, Fred Glover, Bahram Alidaee and Cesar RegoAnnals of Operations Research 139 (1) 229 (2005)
https://doi.org/10.1007/s10479-005-3449-7
Minimization of ordered, symmetric half-products
Wieslaw KubiakDiscrete Applied Mathematics 146 (3) 287 (2005)
https://doi.org/10.1016/j.dam.2004.07.007
Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
Fabio TardellaElectronic Notes in Discrete Mathematics 17 257 (2004)
https://doi.org/10.1016/j.endm.2004.03.054
Graph Partitioning and Continuous Quadratic Programming
William W. Hager and Yaroslav KrylyukSIAM Journal on Discrete Mathematics 12 (4) 500 (1999)
https://doi.org/10.1137/S0895480199335829
Unconstrained 0?1 nonlinear programming: A nondifferentiable approach
Philippe MichelonJournal of Global Optimization 2 (2) 155 (1992)
https://doi.org/10.1007/BF00122052
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