default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXavier Gandibleux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Antonio J. Nebro
, Xavier Gandibleux:
Experiences Using Julia for Implementing Multi-objective Evolutionary Algorithms. MIC (2) 2024: 174-187- 2020
- [j21]Takfarinas Saber, Xavier Gandibleux, Michael O'Neill, Liam Murphy, Anthony Ventresque:
A comparative study of multi-objective machine reassignment algorithms for data centres. J. Heuristics 26(1): 119-150 (2020)
2010 – 2019
- 2017
- [j20]Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh:
A population-based algorithm for solving linear assignment problems with two objectives. Comput. Oper. Res. 79: 291-303 (2017) - [j19]Anthony Przybylski, Xavier Gandibleux:
Multi-objective branch and bound. Eur. J. Oper. Res. 260(3): 856-872 (2017) - [j18]Audrey Cerqueus, Xavier Gandibleux, Anthony Przybylski, Frédéric Saubion:
On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem. J. Heuristics 23(5): 285-319 (2017) - [c13]Xavier Gandibleux:
Peek - Shape - Grab: A Methodology in Three Stages for Approximating the Non-dominated Points of Multiobjective Discrete/Combinatorial Optimization Problems with a Multiobjective Metaheuristic. EMO 2017: 221-235 - 2015
- [j17]Audrey Cerqueus, Anthony Przybylski, Xavier Gandibleux:
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems. Eur. J. Oper. Res. 244(2): 417-433 (2015) - 2014
- [c12]Takfarinas Saber, Anthony Ventresque, Xavier Gandibleux, Liam Murphy:
GeNePi: A Multi-Objective Machine Reassignment Algorithm for Data Centres. Hybrid Metaheuristics 2014: 115-129 - [c11]Philippe Lacomme, Caroline Prodhon, Christian Prins, Xavier Gandibleux, Boris Beillevaire, Libo Ren:
A Split based Approach for the Vehicle Routing Problem with Route Balancing. ICORES 2014: 159-166 - 2013
- [j16]Thomas Vincent, Florian Seipp, Stefan Ruzika, Anthony Przybylski, Xavier Gandibleux:
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case. Comput. Oper. Res. 40(1): 498-509 (2013) - 2011
- [c10]Hugo Fouchal, Xavier Gandibleux, Fabien Lehuédé:
Preferred solutions computed with a label setting algorithm based on Choquet integral for multi-objective shortest paths. MCDM 2011: 143-150 - 2010
- [j15]Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott:
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discret. Optim. 7(3): 149-165 (2010) - [j14]Xavier Delorme, Xavier Gandibleux, Fabien Degoutin:
Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem. Eur. J. Oper. Res. 204(2): 206-217 (2010) - [j13]Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott:
A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme. INFORMS J. Comput. 22(3): 371-386 (2010) - [c9]Hui Li, Dario Landa Silva, Xavier Gandibleux:
Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2009
- [j12]Xavier Delorme, Xavier Gandibleux, Joaquin Rodriguez:
Stability evaluation of a railway timetable at station level. Eur. J. Oper. Res. 195(3): 780-790 (2009) - [j11]Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl, Xavier Gandibleux:
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Networks 54(4): 227-242 (2009) - [e2]Matthias Ehrgott, Carlos M. Fonseca, Xavier Gandibleux, Jin-Kao Hao, Marc Sevaux:
Evolutionary Multi-Criterion Optimization, 5th International Conference, EMO 2009, Nantes, France, April 7-10, 2009. Proceedings. Lecture Notes in Computer Science 5467, Springer 2009, ISBN 978-3-642-01019-4 [contents] - [i1]Carlos M. Fonseca, Xavier Gandibleux, Pekka J. Korhonen, Luis Marti, Boris Naujoks, Lothar Thiele, Jyrki Wallenius, Eckart Zitzler:
09041 Working Group on EMO for Interactive Multiobjective Optimization (1st Round). Hybrid and Robust Approaches to Multiobjective Optimization 2009 - 2008
- [j10]Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott:
Two phase algorithms for the bi-objective assignment problem. Eur. J. Oper. Res. 185(2): 509-533 (2008) - [c8]Xavier Gandibleux, Pierre Riteau, Xavier Delorme:
RECIFE: A MCDSS for Railway Capacity Evaluation. MCDM 2008: 93-103 - [p1]Matthias Ehrgott, Xavier Gandibleux:
Hybrid Metaheuristics for Multi-objective Combinatorial Optimization. Hybrid Metaheuristics 2008: 221-259 - 2007
- [j9]Matthias Ehrgott, Xavier Gandibleux:
Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9): 2674-2694 (2007) - [c7]Joseph M. Pasia, Xavier Gandibleux, Karl F. Doerner, Richard F. Hartl:
Local Search Guided by Path Relinking and Heuristic Bounds. EMO 2007: 501-515 - 2006
- [j8]Xavier Gandibleux, Frédéric Beugnies, Sabine Randriamasy:
Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function. 4OR 4(1): 47-59 (2006) - [j7]Matthias Ehrgott, José Rui Figueira, Xavier Gandibleux:
Preface. Ann. Oper. Res. 147(1): 1-3 (2006) - [j6]Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott:
The biobjective integer minimum cost flow problem - incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm. Comput. Oper. Res. 33: 1459-1463 (2006) - 2005
- [c6]Xavier Gandibleux, Matthias Ehrgott:
1984-2004 - 20 Years of Multiobjective Metaheuristics. But What About the Solution of Combinatorial Problems with Multiple Objectives?. EMO 2005: 33-46 - 2004
- [j5]Xavier Delorme, Xavier Gandibleux, Joaquin Rodriguez:
GRASP for set packing problems. Eur. J. Oper. Res. 153(3): 564-580 (2004) - [c5]Xavier Gandibleux, Xavier Delorme, Vincent T'kindt:
An Ant Colony Optimisation Algorithm for the Set Packing Problem. ANTS Workshop 2004: 49-60 - [e1]Xavier Gandibleux, Marc Sevaux, Kenneth Sörensen, Vincent T'kindt:
Metaheuristics for Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems 535, Springer 2004, ISBN 978-3-540-20637-8 [contents] - 2003
- [c4]Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh:
Use of a Genetic Heritage for Solving the Assignment Problem with Two Objectives. EMO 2003: 43-57 - 2001
- [c3]Xavier Gandibleux, Hiroyuki Morita, Naoki Katoh:
The Supported Solutions Used as a Genetic Information in a Population Heuristics. EMO 2001: 429-442 - [c2]Xavier Delorme, Joaquin Rodriguez, Xavier Gandibleux:
Heuristics for railway infrastructure saturation. ATMOS 2001: 39-53 - 2000
- [j4]Xavier Gandibleux, Arnaud Fréville:
Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case. J. Heuristics 6(3): 361-383 (2000) - [j3]Matthias Ehrgott, Xavier Gandibleux:
A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectr. 22(4): 425-460 (2000)
1990 – 1999
- 1999
- [j2]Xavier Gandibleux:
Interactive multicriteria procedure exploiting a knowledge-based module to select electricity production alternatives: The CASTART system. Eur. J. Oper. Res. 113(2): 355-373 (1999) - 1994
- [j1]Xavier Gandibleux, Camille Rosenthal-Sabroux, Gaëtan Libert:
Multicriteria approach for intelligent decision support in supervisory control. Ann. Oper. Res. 51(7): 327-347 (1994) - 1993
- [c1]Xavier Gandibleux, Igor Crévits, Patrick Millot:
Man-Machine Cooperation in Real-Time Control: Two Case Studies for Future Control Systems. DIISM 1993: 331-342
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:21 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:
