default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSophie N. Parragh
Person information
- affiliation: Johannes Kepler University Linz, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Fabien Tricoire, Sophie N. Parragh, Margaretha Gansterer:
The hiking tourist problem. Central Eur. J. Oper. Res. 32(2): 183-207 (2024)- [j28]Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire:
A matheuristic for tri-objective binary integer linear programming. Comput. Oper. Res. 161: 106397 (2024) - [j27]Miriam Enzi
, Sophie N. Parragh, David Pisinger:
Modeling and solving a corporate vehicle-sharing problem combined with other modes of transport. EURO J. Transp. Logist. 13: 100122 (2024) - [j26]Ricardo Soares, Alexandra F. Marques, Pedro Amorim, Sophie N. Parragh:
Synchronisation in vehicle routing: Classification schema, modelling framework and literature review. Eur. J. Oper. Res. 313(3): 817-840 (2024) - [j25]Nicolas Forget, Sophie N. Parragh:
Enhancing Branch-and-Bound for Multiobjective 0-1 Programming. INFORMS J. Comput. 36(1): 285-304 (2024) - [j24]Fritz Bökler, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire:
An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems. Math. Methods Oper. Res. 100(1): 263-290 (2024) - [c7]Manuel Schlenkrich, Michael Bögl, Anna Gattinger, Ionela Knospe, Sophie N. Parragh:
Integrating Memory-Based Perturbation Operators into a Tabu Search Algorithm for Real-World Production Scheduling Problems. ICORES 2024: 213-220 - 2023
- [c6]Manuel Schlenkrich, Sophie N. Parragh:
Solving large scale industrial production scheduling problems with complex constraints: an overview of the state-of-the-art. ISM 2023: 1028-1037 - [i12]Martin Gutjahr, Sophie N. Parragh, Fabien Tricoire:
Adaptive large neighborhood search for a personnel task scheduling problem with task selection and parallel task assignments. CoRR abs/2302.04494 (2023) - [i11]Najmesadat Nazemi, Sophie N. Parragh, Walter J. Gutjahr:
Bi-objective risk-averse facility location using a subset-based representation of the conditional value-at-risk. CoRR abs/2302.06511 (2023) - [i10]Julius Bauß, Sophie N. Parragh, Michael Stiglmayr:
Adaptive Improvements of Multi-Objective Branch and Bound. CoRR abs/2312.12192 (2023) - 2022
- [j23]Najmesadat Nazemi, Sophie N. Parragh, Walter J. Gutjahr:
Bi-objective facility location under uncertainty with an application in last-mile disaster relief. Ann. Oper. Res. 319(2): 1689-1716 (2022) - [j22]Miriam Enzi, Sophie N. Parragh, Jakob Puchinger:
The bi-objective multimodal car-sharing problem. OR Spectr. 44(2): 307-348 (2022) - [j21]Sophie N. Parragh, Fabien Tricoire, Walter J. Gutjahr:
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem. OR Spectr. 44(2): 419-459 (2022) - [c5]Najmesadat Nazemi, Sophie N. Parragh, Walter J. Gutjahr:
Bi-objective Risk-averse Facility Location using a Subset-based Representation of the Conditional Value-at-Risk. ICORES 2022: 77-85 - [i9]Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire:
A matheuristic for tri-objective binary integer programming. CoRR abs/2205.03386 (2022) - [i8]Nicolas Forget, Sophie N. Parragh:
Enhancing Branch-and-Bound for Multi-Objective 0-1 Programming. CoRR abs/2210.05385 (2022) - 2021
- [j20]Miriam Enzi, Sophie N. Parragh, David Pisinger, Matthias Prandtstetter:
Modeling and solving the multimodal car- and ride-sharing problem. Eur. J. Oper. Res. 293(1): 290-303 (2021) - [c4]Duleabom An, Sophie N. Parragh, Markus Sinnl, Fabien Tricoire:
A LP Relaxation based Matheuristic for Multi-objective Integer Programming. ICORES 2021: 88-98 - [c3]Jakob Berndorfer, Sophie N. Parragh:
Modeling and solving a real world machine scheduling problem with due windows and processing set restrictions. ISM 2021: 1646-1653 - 2020
- [j19]Viktoria A. Hauder, Andreas Beham, Sebastian Raggl, Sophie N. Parragh, Michael Affenzeller:
Resource-constrained multi-project scheduling with activity and time flexibility. Comput. Ind. Eng. 150: 106857 (2020) - [c2]Katalin Fazekas, Markus Sinnl, Armin Biere, Sophie N. Parragh:
Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem. CPAIOR 2020: 186-204 - [c1]Martin Gutjahr, Hans Kellerer, Sophie N. Parragh:
Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system. ISM 2020: 825-832 - [i7]Miriam Enzi, Sophie N. Parragh, David Pisinger, Matthias Prandtstetter:
Modeling and solving the multimodal car- and ride-sharing problem. CoRR abs/2001.05490 (2020) - [i6]Miriam Enzi, Sophie N. Parragh, David Pisinger:
Modeling and solving a vehicle-sharing problem. CoRR abs/2003.08207 (2020) - [i5]Najmesadat Nazemi, Sophie N. Parragh, Walter J. Gutjahr:
Bi-objective facility location in the presence of uncertainty. CoRR abs/2007.07767 (2020) - [i4]Miriam Enzi, Sophie N. Parragh, Jakob Puchinger:
The bi-objective multimodal car-sharing problem. CoRR abs/2010.10344 (2020)
2010 – 2019
- 2019
- [j18]Dominique Feillet, Sophie N. Parragh, Fabien Tricoire:
A local-search based heuristic for the unrestricted block relocation problem. Comput. Oper. Res. 108: 44-56 (2019) - [j17]Sophie N. Parragh, Fabien Tricoire:
Branch-and-Bound for Bi-objective Integer Programming. INFORMS J. Comput. 31(4): 805-822 (2019) - [i3]Viktoria A. Hauder, Andreas Beham, Sebastian Raggl, Sophie N. Parragh, Michael Affenzeller:
On constraint programming for a new flexible project scheduling problem with resource constraints. CoRR abs/1902.09244 (2019) - 2018
- [j16]Sophie N. Parragh, Karl F. Doerner:
Solving routing problems with pairwise synchronization constraints. Central Eur. J. Oper. Res. 26(2): 443-464 (2018) - [i2]Sophie N. Parragh, Fabien Tricoire:
Branch-and-bound for bi-objective integer programming. CoRR abs/1809.06823 (2018) - [i1]Dominique Feillet, Sophie N. Parragh, Fabien Tricoire:
A Local-Search Based Heuristic for the Unrestricted Block Relocation Problem. CoRR abs/1809.08201 (2018) - 2017
- [j15]Sophie N. Parragh, Jean-François Cordeau:
Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows. Comput. Oper. Res. 83: 28-44 (2017) - [j14]Matthias Ehrgott, Ivana Ljubic, Sophie N. Parragh:
Feature cluster: Recent advances in exact methods for multi-objective optimisation. Eur. J. Oper. Res. 260(3): 805-806 (2017) - 2016
- [j13]Kris Braekers, Richard F. Hartl, Sophie N. Parragh, Fabien Tricoire:
A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience. Eur. J. Oper. Res. 248(2): 428-443 (2016) - 2015
- [j12]Attila A. Kovacs, Sophie N. Parragh, Richard F. Hartl:
The multi-objective generalized consistent vehicle routing problem. Eur. J. Oper. Res. 247(2): 441-458 (2015) - [j11]Michael Bögl, Karl F. Doerner, Sophie N. Parragh:
The school bus routing and scheduling problem with transfers. Networks 65(2): 180-203 (2015) - [j10]Sophie N. Parragh, Jorge Pinho de Sousa, Bernardo Almada-Lobo:
The Dial-a-Ride Problem with Split Requests and Profits. Transp. Sci. 49(2): 311-334 (2015) - [j9]Attila A. Kovacs, Bruce L. Golden, Richard F. Hartl, Sophie N. Parragh:
The Generalized Consistent Vehicle Routing Problem. Transp. Sci. 49(4): 796-816 (2015) - 2014
- [j8]Fabien Lehuédé, Renaud Masson, Sophie N. Parragh, Olivier Péton, Fabien Tricoire:
A multi-criteria large neighbourhood search for the transportation of disabled people. J. Oper. Res. Soc. 65(7): 983-1000 (2014) - [j7]Attila A. Kovacs, Sophie N. Parragh, Richard F. Hartl:
A template-based adaptive large neighborhood search for the consistent vehicle routing problem. Networks 63(1): 60-81 (2014) - [j6]Attila A. Kovacs, Bruce L. Golden, Richard F. Hartl, Sophie N. Parragh:
Vehicle routing problems in which consistency considerations are important: A survey. Networks 64(3): 192-213 (2014) - 2013
- [j5]Sophie N. Parragh, Verena Schmid:
Hybrid column generation and large neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 40(1): 490-497 (2013) - 2012
- [j4]Sophie N. Parragh, Jean-François Cordeau, Karl F. Doerner, Richard F. Hartl:
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectr. 34(3): 593-633 (2012) - [j3]Attila A. Kovacs, Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl:
Adaptive large neighborhood search for service technician routing and scheduling problems. J. Sched. 15(5): 579-600 (2012) - 2010
- [j2]Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl:
Variable neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 37(6): 1129-1138 (2010)
2000 – 2009
- 2009
- [j1]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)
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-04 19:59 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:
