default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSourour Elloumi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Natalia Jorquera-Bravo
, Sourour Elloumi, Safia Kedad-Sidhoum, Agnès Plateau:
Fair Energy Allocation for Collective Self-consumption. ISCO 2024: 388-401- 2023
- [j26]Sourour Elloumi, Zoé Verchère:
Efficient linear reformulations for binary polynomial optimization problems. Comput. Oper. Res. 155: 106240 (2023) - [j25]Cristian Duran-Mateluna, Zacharie Alès, Sourour Elloumi, Natalia Jorquera-Bravo:
Robust MILP formulations for the two-stage weighted vertex p-center problem. Comput. Oper. Res. 159: 106334 (2023) - [j24]Cristian Duran-Mateluna, Zacharie Alès, Sourour Elloumi:
An efficient benders decomposition for the p-median problem. Eur. J. Oper. Res. 308(1): 84-96 (2023) - [j23]Zacharie Alès, Sourour Elloumi:
Minimizing recovery cost of network optimization problems. Networks 81(1): 125-151 (2023) - [c11]Zoé Verchère, Sourour Elloumi, Andrea Simonetto:
Optimizing Variational Circuits for Higher-Order Binary Optimization. QCE 2023: 19-25 - 2022
- [c10]Yves Crama, Sourour Elloumi, Amélie Lambert, Elisabeth Rodríguez-Heck:
Quadratic reformulations for the optimization of pseudo-boolean functions. ISAIM 2022 - 2021
- [j22]Sourour Elloumi, Olivier Hudry, Estel Marie, Agathe Martin, Agnès Plateau, Stéphane Rovedakis:
Optimization of wireless sensor networks deployment with coverage and connectivity constraints. Ann. Oper. Res. 298(1): 183-206 (2021) - [j21]Victor Bucarey, Sourour Elloumi, Martine Labbé, Fränk Plein:
Models and algorithms for the product pricing with single-minded customers requesting bundles. Comput. Oper. Res. 127: 105139 (2021) - [j20]Sourour Elloumi, Amélie Lambert, Arnaud Lazare:
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation. J. Glob. Optim. 80(2): 231-248 (2021)
2010 – 2019
- 2019
- [j19]Sourour Elloumi, Amélie Lambert:
Global solution of non-convex quadratically constrained quadratic programs. Optim. Methods Softw. 34(1): 98-114 (2019) - [c9]Hadrien Godard, Sourour Elloumi, Amélie Lambert, Jean Maeght, Manuel Ruiz:
Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization. CoDIT 2019: 1227-1232 - [c8]Sourour Elloumi, Amélie Lambert, Arnaud Lazare:
Semidefinite programming relaxations through quadratic reformulation for box-constrained polynomial optimization problems. CoDIT 2019: 1498-1503 - [i2]Sourour Elloumi, Amélie Lambert, Arnaud Lazare:
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation. CoRR abs/1901.07904 (2019) - [i1]Hadrien Godard, Sourour Elloumi, Amélie Lambert, Jean Maeght, Manuel Ruiz:
Novel Approach Towards Global Optimality of Optimal Power Flow Using Quadratic Convex Optimization. CoRR abs/1903.05390 (2019) - 2018
- [c7]Zacharie Alès, Sourour Elloumi:
Compact MILP Formulations for the p-Center Problem. ISCO 2018: 14-25 - 2017
- [j18]Alain Billionnet, Sourour Elloumi, Amélie Lambert, Angelika Wiegele:
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation. INFORMS J. Comput. 29(2): 318-331 (2017) - [j17]Sabine Tréfond, Alain Billionnet, Sourour Elloumi, Housni Djellab, O. Guyon:
Optimization and simulation for robust railway rolling-stock planning. J. Rail Transp. Plan. Manag. 7(1-2): 33-49 (2017) - [c6]Sourour Elloumi, Olivier Hudry, Estel Marie, Agnès Plateau, Stephane Rovedakis:
Optimization of wireless sensor networks deployment with coverage and connectivity constraints. CoDIT 2017: 336-341 - 2016
- [j16]Alain Billionnet, Sourour Elloumi, Amélie Lambert:
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Math. Program. 158(1-2): 235-266 (2016) - [c5]Sourour Elloumi, Amélie Lambert:
Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem. COCOA 2016: 726-734 - 2015
- [c4]Alain Billionnet, Sourour Elloumi, Aurélie Le Maître:
Optimal Migration Planning of Telecommunication Equipment. MCO (1) 2015: 69-80 - 2014
- [j15]Alain Billionnet, Sourour Elloumi, Amélie Lambert:
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation. J. Comb. Optim. 28(2): 376-399 (2014) - [c3]Sourour Elloumi, Éric Gourdin, Thibaut Lefebvre:
Does network coding improve the throughput of a survivable multicast network ? DRCN 2014: 1-8 - 2013
- [j14]Alain Billionnet, Sourour Elloumi, Amélie Lambert:
An efficient compact quadratic convex reformulation for general integer quadratic programs. Comput. Optim. Appl. 54(1): 141-162 (2013) - 2012
- [j13]Hande Yaman, Sourour Elloumi:
Star p-hub center problem and star p-hub median problem with bounded path lengths. Comput. Oper. Res. 39(11): 2725-2732 (2012) - [j12]Alain Billionnet, Sourour Elloumi, Amélie Lambert:
Extending the QCR method to general mixed-integer programs. Math. Program. 131(1-2): 381-401 (2012) - 2010
- [j11]Sourour Elloumi, Agnès Plateau:
A computational study for the p-median Problem. Electron. Notes Discret. Math. 36: 455-462 (2010) - [j10]Sourour Elloumi:
A tighter formulation of the p-median problem. J. Comb. Optim. 19(1): 69-83 (2010)
2000 – 2009
- 2009
- [j9]Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau:
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method. Discret. Appl. Math. 157(6): 1185-1197 (2009) - 2008
- [j8]Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman:
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. Networks 52(4): 287-298 (2008) - [j7]Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau:
Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations. RAIRO Oper. Res. 42(2): 103-121 (2008) - [c2]Alain Billionnet, Sourour Elloumi, Amélie Lambert:
Linear Reformulations of Integer Quadratic Programs. MCO 2008: 43-51 - 2007
- [j6]Alain Billionnet, Sourour Elloumi:
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem. Math. Program. 109(1): 55-68 (2007) - 2005
- [j5]Alain Billionnet, Sourour Elloumi, Leila Grouz Djerbi:
Designing radio-mobile access networks based on synchronous digital hierarchy rings. Comput. Oper. Res. 32: 379-394 (2005) - 2004
- [j4]Sourour Elloumi, Martine Labbé, Yves Pochet:
A New Formulation and Resolution Method for the p-Center Problem. INFORMS J. Comput. 16(1): 83-94 (2004) - 2002
- [c1]Jean Cardinal, Sourour Elloumi, Martine Labbé:
Local optimization of index assignments for multiple description coding. EUSIPCO 2002: 1-4 - 2001
- [j3]Alain Billionnet, Sourour Elloumi:
Best reduction of the quadratic semi-assignment problem. Discret. Appl. Math. 109(3): 197-213 (2001) - 2000
- [j2]Sourour Elloumi, Alain Faye, Éric Soutif:
Decomposition and Linearization for 0-1 Quadratic Programming. Ann. Oper. Res. 99(1-4): 79-93 (2000)
1990 – 1999
- 1995
- [j1]Alain Billionnet, Sourour Elloumi:
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program. J. Parallel Distributed Comput. 26(2): 225-232 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
