6 | AC Group | TU Wienhttps://ac.tuwien.ac.at/publication-type/6/6Hugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png6https://ac.tuwien.ac.at/publication-type/6/Network Navigation with Online Delays is PSPACE-completehttps://ac.tuwien.ac.at/publication/network-navigation-with-online-delays-is-pspace-complete/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/network-navigation-with-online-delays-is-pspace-complete/A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scootershttps://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-battery-swapping-station-location-planning-for-electric-scooters/Tue, 01 Feb 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-battery-swapping-station-location-planning-for-electric-scooters/A Large Neighborhood Search for Battery Swapping Station Location Planning for Electric Scootershttps://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-battery-swapping-station-location-planning-for-electric-scooters-2/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-large-neighborhood-search-for-battery-swapping-station-location-planning-for-electric-scooters-2/A Relative Value Function Based Learning Beam Search for Longest Common Subsequence Problemshttps://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-longest-common-subsequence-problems/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-relative-value-function-based-learning-beam-search-for-longest-common-subsequence-problems/Learning Value Functions for Same-Day Delivery Problems in the Tardiness Regimehttps://ac.tuwien.ac.at/publication/learning-value-functions-for-same-day-delivery-problems-in-the-tardiness-regime/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-value-functions-for-same-day-delivery-problems-in-the-tardiness-regime/Fixed-Parameter Tractabilityhttps://ac.tuwien.ac.at/publication/fixed-parameter-tractability/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/fixed-parameter-tractability/Crossing Layout in Non-planar Graphshttps://ac.tuwien.ac.at/publication/crossing-layout-in-non-planar-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/crossing-layout-in-non-planar-graphs/VNS and PBIG as Optimization Cores in a Cooperative Optimization Approach for Distributing Service Pointshttps://ac.tuwien.ac.at/publication/vns-and-pbig-as-optimization-cores-in-a-cooperative-optimization-approach-for-distributing-service-points-2/Fri, 01 Feb 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/vns-and-pbig-as-optimization-cores-in-a-cooperative-optimization-approach-for-distributing-service-points-2/A Memetic Algorithm for Competitive Facility Location Problemshttps://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-competitive-facility-location-problems/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-competitive-facility-location-problems/Casual Employee Scheduling with Constraint Programming and Ant Colony Optimizationhttps://ac.tuwien.ac.at/publication/casual-employee-scheduling-with-constraint-programming-and-ant-colony-optimization/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/casual-employee-scheduling-with-constraint-programming-and-ant-colony-optimization/Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problemhttps://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/decision-diagram-based-limited-discrepancy-search-for-a-job-sequencing-problem/Metaheuristic Hybridshttps://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids-2/Graph Visualizationhttps://ac.tuwien.ac.at/publication/graph-visualization/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/graph-visualization/Backdoor Sets for CSPhttps://ac.tuwien.ac.at/publication/backdoor-sets-for-csp/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-sets-for-csp/Crowdsourcing Versus the Laboratory: Towards Human-Centered Experiments Using the Crowdhttps://ac.tuwien.ac.at/publication/crowdsourcing-versus-the-laboratory-towards-human-centered-experiments-using-the-crowd/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/crowdsourcing-versus-the-laboratory-towards-human-centered-experiments-using-the-crowd/A New Type of Metamodel for Longitudinal Dynamics Optimization of Hybrid Electric Vehicleshttps://ac.tuwien.ac.at/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-new-type-of-metamodel-for-longitudinal-dynamics-optimization-of-hybrid-electric-vehicles/Heuristic Approaches for the Probabilistic Traveling Salesman Problemhttps://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem/Reducing the Number of Simulations in Operation Strategy Optimization for Hybrid Electric Vehicleshttps://ac.tuwien.ac.at/publication/reducing-the-number-of-simulations-in-operation-strategy-optimization-for-hybrid-electric-vehicles/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/reducing-the-number-of-simulations-in-operation-strategy-optimization-for-hybrid-electric-vehicles/Scalability Considerations for Multivariate Graph Visualizationhttps://ac.tuwien.ac.at/publication/scalability-considerations-for-multivariate-graph-visualization/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/scalability-considerations-for-multivariate-graph-visualization/A Timeslot-Filling Based Heuristic Approach to Construct High-School Timetableshttps://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables-2/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-timeslot-filling-based-heuristic-approach-to-construct-high-school-timetables-2/Metaheuristic Hybridshttps://ac.tuwien.ac.at/publication/metaheuristic-hybrids/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-hybrids/Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexitäthttps://ac.tuwien.ac.at/publication/visualisierung-von-netzen-algorithmen-anwendungen-und-komplexitat/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/visualisierung-von-netzen-algorithmen-anwendungen-und-komplexitat/(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/meta-heuristic-separation-of-jump-cuts-in-a-branch-cut-approach-for-the-bounded-diameter-minimum-spanning-tree-problem-2/Combining Lagrangian Decomposition with Very Large Scale Neighborhoood Search for Capacitated Connected Facility Locationhttps://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhoood-search-for-capacitated-connected-facility-location/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-lagrangian-decomposition-with-very-large-scale-neighborhoood-search-for-capacitated-connected-facility-location/Hybrid Metaheuristicshttps://ac.tuwien.ac.at/publication/hybrid-metaheuristics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics/MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristicshttps://ac.tuwien.ac.at/publication/metaboosting-enhancing-integer-programming-techniques-by-metaheuristics/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaboosting-enhancing-integer-programming-techniques-by-metaheuristics/A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problemhttps://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-evolutionary-algorithm-hybrid-for-the-knapsack-constrained-maximum-spanning-tree-problem-2/Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimizationhttps://ac.tuwien.ac.at/publication/combining-integer-linear-programming-techniques-and-metaheuristics-for-combinatorial-optimization/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-integer-linear-programming-techniques-and-metaheuristics-for-combinatorial-optimization/Parameterized SAThttps://ac.tuwien.ac.at/publication/parameterized-sat/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-sat/Geographic Visualizationhttps://ac.tuwien.ac.at/publication/geographic-visualization/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/geographic-visualization/