Sophie N. Parragh

Orcid: 0000-0002-7428-9770

Affiliations:
  • Johannes Kepler University Linz, Austria


According to our database1, Sophie N. Parragh authored at least 43 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems.
Math. Methods Oper. Res., August, 2024

The hiking tourist problem.
Central Eur. J. Oper. Res., June, 2024

Synchronisation in vehicle routing: Classification schema, modelling framework and literature review.
Eur. J. Oper. Res., March, 2024

A matheuristic for tri-objective binary integer linear programming.
Comput. Oper. Res., January, 2024

Enhancing Branch-and-Bound for Multiobjective 0-1 Programming.
INFORMS J. Comput., 2024

Modeling and solving a corporate vehicle-sharing problem combined with other modes of transport.
EURO J. Transp. Logist., 2024

Integrating Memory-Based Perturbation Operators into a Tabu Search Algorithm for Real-World Production Scheduling Problems.
Proceedings of the 13th International Conference on Operations Research and Enterprise Systems, 2024

2023
Adaptive Improvements of Multi-Objective Branch and Bound.
CoRR, 2023

Adaptive large neighborhood search for a personnel task scheduling problem with task selection and parallel task assignments.
CoRR, 2023

Solving large scale industrial production scheduling problems with complex constraints: an overview of the state-of-the-art.
Proceedings of the 4th International Conference on Industry 4.0 and Smart Manufacturing (ISM 2023), 2023

2022
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem.
OR Spectr., 2022

The bi-objective multimodal car-sharing problem.
OR Spectr., 2022

Enhancing Branch-and-Bound for Multi-Objective 0-1 Programming.
CoRR, 2022

A matheuristic for tri-objective binary integer programming.
CoRR, 2022

Bi-objective facility location under uncertainty with an application in last-mile disaster relief.
Ann. Oper. Res., 2022

Bi-objective Risk-averse Facility Location using a Subset-based Representation of the Conditional Value-at-Risk.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

2021
Modeling and solving the multimodal car- and ride-sharing problem.
Eur. J. Oper. Res., 2021

Modeling and solving a real world machine scheduling problem with due windows and processing set restrictions.
Proceedings of the 3rd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2022), Virtual Event / Upper Austria University of Applied Sciences - Hagenberg Campus, 2021

A LP Relaxation based Matheuristic for Multi-objective Integer Programming.
Proceedings of the 10th International Conference on Operations Research and Enterprise Systems, 2021

2020
Bi-objective facility location in the presence of uncertainty.
CoRR, 2020

Modeling and solving a vehicle-sharing problem.
CoRR, 2020

Resource-constrained multi-project scheduling with activity and time flexibility.
Comput. Ind. Eng., 2020

Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system.
Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020), 2020

Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019
Branch-and-Bound for Bi-objective Integer Programming.
INFORMS J. Comput., 2019

On constraint programming for a new flexible project scheduling problem with resource constraints.
CoRR, 2019

A local-search based heuristic for the unrestricted block relocation problem.
Comput. Oper. Res., 2019

2018
Solving routing problems with pairwise synchronization constraints.
Central Eur. J. Oper. Res., 2018

2017
Feature cluster: Recent advances in exact methods for multi-objective optimisation.
Eur. J. Oper. Res., 2017

Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows.
Comput. Oper. Res., 2017

2016
A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience.
Eur. J. Oper. Res., 2016

2015
The Dial-a-Ride Problem with Split Requests and Profits.
Transp. Sci., 2015

The Generalized Consistent Vehicle Routing Problem.
Transp. Sci., 2015

The school bus routing and scheduling problem with transfers.
Networks, 2015

The multi-objective generalized consistent vehicle routing problem.
Eur. J. Oper. Res., 2015

2014
A template-based adaptive large neighborhood search for the consistent vehicle routing problem.
Networks, 2014

Vehicle routing problems in which consistency considerations are important: A survey.
Networks, 2014

A multi-criteria large neighbourhood search for the transportation of disabled people.
J. Oper. Res. Soc., 2014

2013
Hybrid column generation and large neighborhood search for the dial-a-ride problem.
Comput. Oper. Res., 2013

2012
Adaptive large neighborhood search for service technician routing and scheduling problems.
J. Sched., 2012

Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints.
OR Spectr., 2012

2010
Variable neighborhood search for the dial-a-ride problem.
Comput. Oper. Res., 2010

2009
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem.
Networks, 2009


  Loading...