Optimisation de programmes polynomiaux en variables 0-1 et sans contraintes

Claudia d'Ambrosio; Sourour Elloumi; Amélie Lambert; Arnaud Lazare

Conference papers

Global solution of unconstrained binary polynomial optimization problems

Optimisation de programmes polynomiaux en variables 0-1 et sans contraintes

Claudia d'Ambrosio ¹ Sourour Elloumi ² Amélie Lambert ² Arnaud Lazare ²

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

2 CEDRIC - OC - CEDRIC. Optimisation Combinatoire

CEDRIC - Centre d'études et de recherche en informatique et communications

Document type :

Conference papers

Domain :

Computer Science [cs] / Operations Research [cs.RO]

Complete list of metadatas

Cited literature [4 references] Display Hide Download

https://hal.archives-ouvertes.fr/hal-02455556
Contributor : Amélie Lambert <>
Submitted on : Friday, February 21, 2020 - 10:43:39 AM
Last modification on : Friday, August 21, 2020 - 1:56:05 PM
Long-term archiving on: : Friday, May 22, 2020 - 3:13:20 PM

ROADEF2017_paper_25.pdf

Files produced by the author(s)

Global solution of unconstrained binary polynomial optimization problems

Optimisation de programmes polynomiaux en variables 0-1 et sans contraintes

File

Identifiers

Collections

Citation

Export

Metrics

41

12

en fr Global solution of unconstrained binary polynomial optimization problems Optimisation de programmes polynomiaux en variables 0-1 et sans contraintes

File

Identifiers

Collections

Citation

Export

Share

Metrics

41

12

Global solution of unconstrained binary polynomial optimization problems

Optimisation de programmes polynomiaux en variables 0-1 et sans contraintes