default search action
Philippe Mahey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j26]Ernesto Oré
, Philippe Mahey, Eladio Ocaña
Inertial-relaxed splitting for composite monotone inclusions. Open J. Math. Optim. 4: 1-20 (2023) - 2021
- [j25]Rui Sa Shibasaki
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods. Int. Trans. Oper. Res. 28(1): 296-326 (2021)
2010 – 2019
- 2017
- [j24]Philippe Mahey, Jonas Koko, Arnaud Lenoir:
Decomposition methods for a spatial model for long-term energy pricing problem. Math. Methods Oper. Res. 85(1): 137-153 (2017) - [j23]Arnaud Lenoir, Philippe Mahey:
A survey on operator splitting and decomposition of convex programs. RAIRO Oper. Res. 51(1): 17-41 (2017) - 2016
- [j22]Christophe Duhamel
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem. 4OR 14(2): 201-220 (2016) - [j21]Vinicius Morais, Alexandre Salles da Cunha, Philippe Mahey:
A Branch-and-cut-and-price algorithm for the Stackelberg Minimum Spanning Tree Game. Electron. Notes Discret. Math. 52: 309-316 (2016) - 2013
- [j20]Shahin Gelareh
Single string planning problem arising in liner shipping industries: A heuristic approach. Comput. Oper. Res. 40(10): 2357-2373 (2013) - [j19]Jean-François Landry, Jean-Pierre Dussault, Philippe Mahey:
A Heuristic-Based Planner and Improved Controller for a Two-Layered Approach for the Game of Billiards. IEEE Trans. Comput. Intell. AI Games 5(4): 325-336 (2013) - 2012
- [j18]Alexandre Xavier Martins, Christophe Duhamel
Variable neighborhood descent with iterated local search for routing and wavelength assignment. Comput. Oper. Res. 39(9): 2133-2141 (2012) - [j17]Jean-François Landry, Jean-Pierre Dussault, Philippe Mahey:
A robust controller for a two-layered approach applied to the game of billiards. Entertain. Comput. 3(3): 59-70 (2012) - 2011
- [c3]Jean-François Landry, Jean-Pierre Dussault, Philippe Mahey:
Billiards: an optimization challenge. C3S2E 2011: 129-132 - [c2]Alexandre Xavier Martins, Christophe Duhamel
A VND-ILS Heuristic to Solve the RWA Problem. INOC 2011: 577-582 - 2010
- [j16]Jérôme Truffot, Christophe Duhamel
k-Splittable delay constrained routing problem: A branch-and-price approach. Networks 55(1): 33-45 (2010) - [j15]Philippe Mahey, Alain Quilliot:
Editorial. The MODE/ROADEF 2008 Conference. RAIRO Oper. Res. 44(1): 43-44 (2010)
2000 – 2009
- 2008
- [j14]Benedicte Vatinlen, Fabrice Chauvet, Philippe Chrétienne, Philippe Mahey:
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths. Eur. J. Oper. Res. 185(3): 1390-1401 (2008) - [j13]Maurício C. de Souza
Cycle-based algorithms for multicommodity network flow problems with separable piecewise convex costs. Networks 51(2): 133-141 (2008) - 2007
- [j12]Bruno Bachelet
Elastic time computation in QoS-driven hypermedia presentations. Multim. Syst. 12(6): 461-478 (2007) - [j11]Christophe Duhamel
Multicommodity flow problems with a bounded number of paths: A flow deviation approach. Networks 49(1): 80-89 (2007) - [j10]Philippe Mahey, Maurício C. de Souza
Local optimality conditions for multicommodity flow problems with separable piecewise convex costs. Oper. Res. Lett. 35(2): 221-226 (2007) - [c1]Jérôme Truffot, Christophe Duhamel
k-splittable delay constrained routing problem: A branch and price approach. DRCN 2007: 1-8 - 2006
- [p1]Abdel Lisser, Philippe Mahey:
Multicommodity Flow Problems and Decomposition in Telecommunications Networks. Handbook of Optimization in Telecommunications 2006: 241-267 - 2004
- [j9]Bruno Bachelet
Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs. 4OR 2(4): 275-291 (2004) - 2003
- [j8]Bruno Bachelet
Minimum convex-cost tension problems on series-parallel graphs. RAIRO Oper. Res. 37(4): 221-234 (2003) - 2001
- [j7]Philippe Mahey, Abdelhamid Benchakroun, Florence Boyer:
Capacity and flow assignment of data networks by generalized Benders decomposition. J. Glob. Optim. 20(2): 169-189 (2001) - 2000
- [j6]Adam Ouorou, Philippe Mahey:
A minimum mean cycle cancelling method for nonlinear multicommodity flow problems. Eur. J. Oper. Res. 121(3): 532-548 (2000)
1990 – 1999
- 1999
- [j5]Larry J. LeBlanc, Jerome Chifflet, Philippe Mahey:
Packet Routing in Telecommunication Networks with Path and Flow Restrictions. INFORMS J. Comput. 11(2): 188-197 (1999) - 1998
- [j4]Bruno-Laurent Garcia, Philippe Mahey, Larry J. LeBlanc:
Iterative improvement methods for a multiperiod network design problem. Eur. J. Oper. Res. 110(1): 150-165 (1998) - [j3]Philippe Mahey, Adam Ouorou, Larry J. LeBlanc, Jerome Chifflet:
A new proximal decomposition algorithm for routing in telecommunication networks. Networks 31(4): 227-238 (1998) - 1995
- [j2]Philippe Mahey, Said Oualibouch
Proximal Decomposition on the Graph of a Maximal Monotone Operator. SIAM J. Optim. 5(2): 454-466 (1995) - 1994
- [j1]Jerome Chifflet, Philippe Mahey, V. Reynier:
Proximal decomposition for multicommodity flow problems with convex costs. Telecommun. Syst. 3(1): 1-10 (1994) - 1990
- [b1]Philippe Mahey:
Méthodes de décomposition pour la programmation mathématique. Grenoble Institute of Technology, France, 1990
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 22:17 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: