default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnthony Przybylski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j10]Nicolas Forget
, Sune Lauth Gadegaard, Kathrin Klamroth, Lars Relund Nielsen, Anthony Przybylski:
Branch-and-bound and objective branching with three or more objectives. Comput. Oper. Res. 148: 106012 (2022)- 2020
- [j9]Pascal Halffmann, Tobias Dietz, Anthony Przybylski, Stefan Ruzika:
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem. J. Glob. Optim. 77(4): 715-742 (2020)
2010 – 2019
- 2019
- [i1]Anthony Przybylski, Kathrin Klamroth, Renaud Lacour:
A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs. CoRR abs/1911.08937 (2019) - 2017
- [j8]Anthony Przybylski, Xavier Gandibleux:
Multi-objective branch and bound. Eur. J. Oper. Res. 260(3): 856-872 (2017) - [j7]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) - 2015
- [j6]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) - 2013
- [j5]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) - 2010
- [j4]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) - [j3]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)
2000 – 2009
- 2008
- [j2]Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott:
Two phase algorithms for the bi-objective assignment problem. Eur. J. Oper. Res. 185(2): 509-533 (2008) - 2006
- [j1]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)
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-09 20:32 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:
