BQOA

Binary Quadratic Optimization and Applications

Coordinatore	UNIVERSITE D'AVIGNON ET DES PAYS DE VAUCLUSE    more  Organization address address: RUE LOUIS PASTEUR 74 city: AVIGNON postcode: 84029 contact info Titolo: Ms. Nome: Elodie Cognome: Popenda Email: send email Telefono: +33 4 90 16 29 86 Fax: +33 4 90 16 25 31
Nazionalità Coordinatore	France [FR]
Totale costo	194˙046 €
EC contributo	194˙046 €
Programma	FP7-PEOPLE Specific programme "People" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013)
Code Call	FP7-PEOPLE-2012-IIF
Funding Scheme	MC-IIF
Anno di inizio	0
Periodo (anno-mese-giorno)	0000-00-00   -   0000-00-00

 Partecipanti

#	participant	country	role	EC contrib. [€]
1	UNIVERSITE D'AVIGNON ET DES PAYS DE VAUCLUSE  Organization address address: RUE LOUIS PASTEUR 74 city: AVIGNON postcode: 84029 contact info Titolo: Ms. Nome: Elodie Cognome: Popenda Email: send email Telefono: +33 4 90 16 29 86 Fax: +33 4 90 16 25 31	FR (AVIGNON)	coordinator	194˙046.60

Mappa

 Word cloud

Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.

 Obiettivo del progetto (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.'