A lower bound for a constrained quadratic 0–1 minimization problem-Reference-Cited by-同舟云学术

A lower bound for a constrained quadratic 0–1 minimization problem

Published:1997-04 Issue:2 Volume:74 Page:135-146
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Billionnet Alain,Faye Alain

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference15 articles.

1. Unconstrained 0–1 optimization and Lagrangean relaxation;Adams;Discrete Appl. Math.,1990

2. Maximizing a supermodular pseudo-Boolean function: a polynomial algorithm for supermodular cubic functions;Billionnet;Discrete Appl. Math.,1985

3. Upper bounds for quadratic 0–1 maximization;Boros;Oper. Res. Lett.,1990

4. Chvatal cuts and odd cycle inequalities in quadratic 0–1 optimization;Boros;SIAM J. Discrete Math.,1992

5. Recognition problems for special classes of polynomials in 0–1 variables;Crama;Math. Programming,1989

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Co-locating services in IoT systems to minimize the communication energy cost;Journal of Innovation in Digital Ecosystems;2014-12

2. Communication Energy Aware Sensor Selection in IoT Systems;2014 IEEE International Conference on Internet of Things(iThings), and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom);2014-09

3. Quadratic Optimization in 0-1 Variables;Concepts of Combinatorial Optimization;2014-08-08

4. General Bibliography;Concepts of Combinatorial Optimization;2014-08-08

5. Estimation in Phase-Shift and Forward Wireless Sensor Networks;IEEE Transactions on Signal Processing;2013-08