Skip to main content
Go to the home page of the European Commission (opens in new window)
English en
CORDIS - EU research results
CORDIS
Content archived on 2024-05-28

Binary Quadratic Optimization and Applications

Objective

Several combinatorial and discrete optimization problems can be modelled using a quadratic objective function subject to binary constraints; such models are called binary quadratic problems (BQP). These problems are hard to solve in general thus, relaxations are used to find bounds and near optimal solutions. Quadratic programming problems with binary variables arise in many settings, including engineering, finance, transportation, and location problems. The study of linear programming problems with binary variables has been wide ranging, covering many applications and developing many theoretical facets. On the other hand, finding global solutions or even good quality bounds for quadratic programming problems with binary variables has been regarded as a very challenging area of research due to the hardness and complexity of the problem. For the proposed research, we intend to develop new optimization schemes for constrained binary quadratic programming problems by utilizing semidefinite and linear programming techniques. Based on these schemes, we investigate developing efficient algorithms to find global optimal solutions for three challenging applications of binary quadratic programming. In particular, we consider applications in traffic network planning, location and network planning, and satellite communication network planning problems.

Fields of science (EuroSciVoc)

Topic(s)

Call for proposal

FP7-PEOPLE-2012-IIF
See other projects for this call

Funding Scheme

MC-IIF - International Incoming Fellowships (IIF)

Coordinator

AVIGNON UNIVERSITE
EU contribution
€ 194 046,60
Address
RUE LOUIS PASTEUR 74
84029 AVIGNON CEDEX 01
France
Region
Ile-de-France Ile-de-France Paris
Activity type
Higher or Secondary Education Establishments
Links
Total cost
No data