https://ac.tuwien.ac.at/publication-type/7/7Hugo Blox Builder (https://hugoblox.com)en-usSat, 01 Aug 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pnghttps://ac.tuwien.ac.at/publication-type/7/https://ac.tuwien.ac.at/publication/heuristic-optimization-of-integrated-energy-systems-an-extension-to-the-iesopt-framework/Sat, 01 Aug 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-optimization-of-integrated-energy-systems-an-extension-to-the-iesopt-framework/https://ac.tuwien.ac.at/publication/lower-bounds-and-algorithms-for-covering-sequences-of-subsets-of-a-finite-set/Sat, 01 Aug 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/lower-bounds-and-algorithms-for-covering-sequences-of-subsets-of-a-finite-set/https://ac.tuwien.ac.at/publication/denoising-diffusion-based-evolutionary-algorithms-exploring-hybridizations-of-evolutionary-algorithms-with-denoising-diffusion-models/Sat, 01 Mar 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/denoising-diffusion-based-evolutionary-algorithms-exploring-hybridizations-of-evolutionary-algorithms-with-denoising-diffusion-models/https://ac.tuwien.ac.at/publication/optimizing-elevator-control-with-a-destination-registration-system/Sat, 01 Mar 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimizing-elevator-control-with-a-destination-registration-system/https://ac.tuwien.ac.at/publication/an-alphazero-agent-for-just-4-fun-a-non-deterministic-game-with-imperfect-information/Tue, 01 Oct 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-alphazero-agent-for-just-4-fun-a-non-deterministic-game-with-imperfect-information/https://ac.tuwien.ac.at/publication/graph-neural-networks-meet-local-search-for-the-weighted-total-domination-problem/Tue, 01 Oct 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/graph-neural-networks-meet-local-search-for-the-weighted-total-domination-problem/https://ac.tuwien.ac.at/publication/strength-estimation-in-the-game-of-go/Tue, 01 Oct 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/strength-estimation-in-the-game-of-go/https://ac.tuwien.ac.at/publication/computational-optimization-approaches-for-distributing-battery-exchange-stations-for-electric-scooters/Fri, 01 Sep 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/computational-optimization-approaches-for-distributing-battery-exchange-stations-for-electric-scooters/https://ac.tuwien.ac.at/publication/a-learning-multilevel-optimization-approach-for-a-large-location-allocation-problem/Mon, 01 May 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-learning-multilevel-optimization-approach-for-a-large-location-allocation-problem/https://ac.tuwien.ac.at/publication/advancing-state-space-search-for-static-and-dynamic-optimization-by-parallelization-and-learning/Mon, 01 May 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/advancing-state-space-search-for-static-and-dynamic-optimization-by-parallelization-and-learning/https://ac.tuwien.ac.at/publication/hybrid-approaches-to-sports-league-scheduling-using-constraint-programming-and-simulated-annealing/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-approaches-to-sports-league-scheduling-using-constraint-programming-and-simulated-annealing/https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-based-on-large-neighborhood-search-and-mixed-integer-linear-programming-for-the-directed-feedback-vertex-set-problem/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-based-on-large-neighborhood-search-and-mixed-integer-linear-programming-for-the-directed-feedback-vertex-set-problem/https://ac.tuwien.ac.at/publication/optimization-of-container-transportation-for-fixed-schedule-block-trains-with-optional-round-trips-in-collaborative-logistics/Thu, 01 Dec 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimization-of-container-transportation-for-fixed-schedule-block-trains-with-optional-round-trips-in-collaborative-logistics/https://ac.tuwien.ac.at/publication/minimizing-makespan-in-flow-shops-with-a-reinforcement-learning-like-approach/Sun, 01 May 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/minimizing-makespan-in-flow-shops-with-a-reinforcement-learning-like-approach/https://ac.tuwien.ac.at/publication/computational-optimization-approaches-for-distributing-service-points-for-mobility-applications-and-smart-charging-of-electric-vehicles/Tue, 01 Feb 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/computational-optimization-approaches-for-distributing-service-points-for-mobility-applications-and-smart-charging-of-electric-vehicles/https://ac.tuwien.ac.at/publication/a-matheuristic-for-battery-exchange-station-location-planning-for-electric-scooters/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-matheuristic-for-battery-exchange-station-location-planning-for-electric-scooters/https://ac.tuwien.ac.at/publication/on-hard-subgraph-problems-parameterized-algorithms-and-efficient-implementations/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-hard-subgraph-problems-parameterized-algorithms-and-efficient-implementations/https://ac.tuwien.ac.at/publication/scrambling-permutations-and-related-structures-asymptotics-and-constructions/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/scrambling-permutations-and-related-structures-asymptotics-and-constructions/https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-solving-string-problems-from-bioinformatics/Wed, 01 Dec 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-solving-string-problems-from-bioinformatics/https://ac.tuwien.ac.at/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem-2/Fri, 01 Oct 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-learning-large-neighborhood-search-for-the-staff-rerostering-problem-2/https://ac.tuwien.ac.at/publication/computational-methods-for-fleet-scheduling-in-e-mobility/Sun, 01 Aug 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/computational-methods-for-fleet-scheduling-in-e-mobility/https://ac.tuwien.ac.at/publication/scheduling-the-charging-of-electric-vehicles-with-soc-dependent-maximum-charging-power/Thu, 01 Apr 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/scheduling-the-charging-of-electric-vehicles-with-soc-dependent-maximum-charging-power/https://ac.tuwien.ac.at/publication/randomized-construction-approaches-to-the-traveling-tournament-problem-using-lower-bound-based-heuristics/Mon, 01 Mar 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/randomized-construction-approaches-to-the-traveling-tournament-problem-using-lower-bound-based-heuristics/https://ac.tuwien.ac.at/publication/casual-employee-scheduling-with-constraint-programming-and-metaheuristics-2/Sun, 01 Nov 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/casual-employee-scheduling-with-constraint-programming-and-metaheuristics-2/https://ac.tuwien.ac.at/publication/solving-a-generalized-constrained-longest-common-subsequence-problem/Mon, 01 Jun 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-generalized-constrained-longest-common-subsequence-problem/https://ac.tuwien.ac.at/publication/combinatorial-optimization-approaches-for-graph-construction-problems/Wed, 01 Apr 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/combinatorial-optimization-approaches-for-graph-construction-problems/https://ac.tuwien.ac.at/publication/heuristische-optimierungsverfahren-fur-die-koordinierung-von-flughafenslots/Sun, 01 Mar 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristische-optimierungsverfahren-fur-die-koordinierung-von-flughafenslots/https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-job-sequencing-with-one-common-and-multiple-secondary-resources-problem-2/Sun, 01 Dec 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-job-sequencing-with-one-common-and-multiple-secondary-resources-problem-2/https://ac.tuwien.ac.at/publication/perfect-pseudo-matchings-on-snarks/Wed, 01 May 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/perfect-pseudo-matchings-on-snarks/https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-3/Mon, 01 Apr 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-a-weighted-set-covering-problem-for-improving-algorithms-for-cutting-stock-problems-with-setup-costs-by-solution-merging-3/https://ac.tuwien.ac.at/publication/a-heuristic-approach-to-aircraft-trajectory-optimization-with-constraints/Fri, 01 Mar 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-heuristic-approach-to-aircraft-trajectory-optimization-with-constraints/https://ac.tuwien.ac.at/publication/algorithmic-approaches-for-optimization-problems-in-bike-sharing-and-security-control/Fri, 01 Mar 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-approaches-for-optimization-problems-in-bike-sharing-and-security-control/https://ac.tuwien.ac.at/publication/automated-calculation-of-optimal-adjustment-parameters-for-myoelectric-hand-prostheses/Fri, 01 Mar 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/automated-calculation-of-optimal-adjustment-parameters-for-myoelectric-hand-prostheses/https://ac.tuwien.ac.at/publication/patient-scheduling-in-particle-therapy/Fri, 01 Mar 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/patient-scheduling-in-particle-therapy/https://ac.tuwien.ac.at/publication/advances-in-decomposition-approaches-for-mixed-integer-linear-programming/Thu, 01 Nov 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/advances-in-decomposition-approaches-for-mixed-integer-linear-programming/https://ac.tuwien.ac.at/publication/methods-for-intraday-scheduling-in-particle-therapy/Thu, 01 Nov 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/methods-for-intraday-scheduling-in-particle-therapy/https://ac.tuwien.ac.at/publication/local-search-methods-for-the-particle-therapy-patient-scheduling-problem/Sat, 01 Sep 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/local-search-methods-for-the-particle-therapy-patient-scheduling-problem/https://ac.tuwien.ac.at/publication/monero-chross-chain-traceability/Sat, 01 Sep 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/monero-chross-chain-traceability/https://ac.tuwien.ac.at/publication/parallel-hybrid-metaheuristics-for-solving-the-firefighter-problem-using-the-gpu/Fri, 01 Jun 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/parallel-hybrid-metaheuristics-for-solving-the-firefighter-problem-using-the-gpu/https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-high-resolution-scheduling-problems/Sun, 01 Oct 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-iterative-time-bucket-refinement-algorithm-for-high-resolution-scheduling-problems/https://ac.tuwien.ac.at/publication/metaheuristics-for-the-districting-and-routing-problem-for-security-control/Sun, 01 May 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristics-for-the-districting-and-routing-problem-for-security-control/https://ac.tuwien.ac.at/publication/complete-solution-archives-for-evolutionary-combinatorial-optimization-application-to-a-competitive-facility-location-and-stochastic-vehicle-routing-problem/Fri, 01 Apr 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/complete-solution-archives-for-evolutionary-combinatorial-optimization-application-to-a-competitive-facility-location-and-stochastic-vehicle-routing-problem/https://ac.tuwien.ac.at/publication/column-generation-at-strip-level-for-the-k-staged-two-dimensional-cutting-stock-problem/Tue, 01 Mar 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/column-generation-at-strip-level-for-the-k-staged-two-dimensional-cutting-stock-problem/https://ac.tuwien.ac.at/publication/a-branch-and-bound-approach-for-the-constrained-k-staged-2-dimensional-cutting-stock-problem/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-branch-and-bound-approach-for-the-constrained-k-staged-2-dimensional-cutting-stock-problem/https://ac.tuwien.ac.at/publication/parameterized-complexity-in-the-polynomial-hierarchy/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/parameterized-complexity-in-the-polynomial-hierarchy/https://ac.tuwien.ac.at/publication/visibility-based-obstacle-placing-automated-obstacle-placing-based-on-circularity/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/visibility-based-obstacle-placing-automated-obstacle-placing-based-on-circularity/https://ac.tuwien.ac.at/publication/solving-the-travelling-thief-problem-with-an-evolutionary-algorithm/Tue, 01 Sep 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-travelling-thief-problem-with-an-evolutionary-algorithm/https://ac.tuwien.ac.at/publication/electric-vehicles-recharge-scheduling-with-logic-based-benders-decomposition/Wed, 01 Jul 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/electric-vehicles-recharge-scheduling-with-logic-based-benders-decomposition/https://ac.tuwien.ac.at/publication/optimization-approaches-for-recreational-bicycle-tour-planning/Wed, 01 Apr 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimization-approaches-for-recreational-bicycle-tour-planning/https://ac.tuwien.ac.at/publication/solving-the-multi-objective-steiner-tree-problem-with-resources/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-multi-objective-steiner-tree-problem-with-resources/https://ac.tuwien.ac.at/publication/heuristic-solution-approaches-for-the-two-dimensional-pre-marshalling-problem/Sun, 01 Jun 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-solution-approaches-for-the-two-dimensional-pre-marshalling-problem/https://ac.tuwien.ac.at/publication/pfadsuche-in-einer-triangulation-reduction-im-mammoth-massive-multiplayer-online-research-framework/Thu, 01 May 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/pfadsuche-in-einer-triangulation-reduction-im-mammoth-massive-multiplayer-online-research-framework/https://ac.tuwien.ac.at/publication/a-hybrid-algorithm-for-the-partition-coloring-problem/Sat, 01 Feb 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-algorithm-for-the-partition-coloring-problem/https://ac.tuwien.ac.at/publication/applying-ant-colony-optimization-to-the-periodic-vehicle-routing-problem-with-time-windows/Sat, 01 Feb 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/applying-ant-colony-optimization-to-the-periodic-vehicle-routing-problem-with-time-windows/https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-by-gpu-based-parallel-ant-colony-optimization/Sat, 01 Feb 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-by-gpu-based-parallel-ant-colony-optimization/https://ac.tuwien.ac.at/publication/balancing-bike-sharing-systems/Sun, 01 Dec 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bike-sharing-systems/https://ac.tuwien.ac.at/publication/the-rooted-delay-constrained-steiner-tree-problem-with-uncertain-delays/Sun, 01 Dec 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-rooted-delay-constrained-steiner-tree-problem-with-uncertain-delays/https://ac.tuwien.ac.at/publication/two-phase-local-search-for-the-bi-objective-connected-facility-location-problem/Sun, 01 Dec 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/two-phase-local-search-for-the-bi-objective-connected-facility-location-problem/https://ac.tuwien.ac.at/publication/optimization-challenges-of-the-future-federated-internet/Tue, 01 Oct 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimization-challenges-of-the-future-federated-internet/https://ac.tuwien.ac.at/publication/analyse-und-implementierung-von-fallzusammenfuhrungen-diagnosebezogener-fallgruppen-aus-sicht-eines-krankenhausinformationssystems/Thu, 01 Aug 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/analyse-und-implementierung-von-fallzusammenfuhrungen-diagnosebezogener-fallgruppen-aus-sicht-eines-krankenhausinformationssystems/https://ac.tuwien.ac.at/publication/metaheuristic-optimization-of-electro-hybrid-powertrains-using-machine-learning-techniques/Thu, 01 Aug 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-optimization-of-electro-hybrid-powertrains-using-machine-learning-techniques/https://ac.tuwien.ac.at/publication/critical-links-detection-using-cuda/Mon, 01 Apr 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/critical-links-detection-using-cuda/https://ac.tuwien.ac.at/publication/selective-graph-coloring-problem/Mon, 01 Apr 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/selective-graph-coloring-problem/https://ac.tuwien.ac.at/publication/metaheuristics-for-the-regenerator-location-problem/Fri, 01 Mar 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristics-for-the-regenerator-location-problem/https://ac.tuwien.ac.at/publication/extending-the-gecode-framework-with-interval-constraint-programming/Mon, 01 Oct 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/extending-the-gecode-framework-with-interval-constraint-programming/https://ac.tuwien.ac.at/publication/improving-the-protein-identification-performance-in-high-resolution-mass-spectrometry-data/Mon, 01 Oct 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/improving-the-protein-identification-performance-in-high-resolution-mass-spectrometry-data/https://ac.tuwien.ac.at/publication/the-vehicle-routing-problem-with-compartments/Mon, 01 Oct 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-vehicle-routing-problem-with-compartments/https://ac.tuwien.ac.at/publication/solving-multimodal-resource-constrained-project-scheduling-problems/Sat, 01 Sep 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-multimodal-resource-constrained-project-scheduling-problems/https://ac.tuwien.ac.at/publication/enhancing-an-evolutionary-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/Tue, 01 May 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/enhancing-an-evolutionary-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-and-matheuristics-for-problems-in-bioinformatics-and-transportation/Tue, 01 May 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-and-matheuristics-for-problems-in-bioinformatics-and-transportation/https://ac.tuwien.ac.at/publication/metaheuristics-for-a-multimodal-home-health-care-scheduling-problem/Tue, 01 May 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristics-for-a-multimodal-home-health-care-scheduling-problem/https://ac.tuwien.ac.at/publication/on-solving-constrained-tree-problems-and-an-adaptive-layers-framework/Tue, 01 May 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-solving-constrained-tree-problems-and-an-adaptive-layers-framework/https://ac.tuwien.ac.at/publication/description-logic-based-reasoning-on-programming-languages/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/description-logic-based-reasoning-on-programming-languages/https://ac.tuwien.ac.at/publication/a-multilevel-refinement-approach-to-the-rooted-delay-constrained-steiner-tree-problem/Thu, 01 Sep 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-multilevel-refinement-approach-to-the-rooted-delay-constrained-steiner-tree-problem/https://ac.tuwien.ac.at/publication/ein-losungsarchiv-mit-branch-and-bound-erweiterung-fur-das-generalized-minimum-spanning-tree-problem/Thu, 01 Sep 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-losungsarchiv-mit-branch-and-bound-erweiterung-fur-das-generalized-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/heuristic-methods-for-the-hop-constrained-survivable-network-design-problem/Thu, 01 Sep 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-methods-for-the-hop-constrained-survivable-network-design-problem/https://ac.tuwien.ac.at/publication/branch-and-price-for-the-steiner-tree-problem-with-revenues-budget-and-hop-constraints/Mon, 01 Aug 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/branch-and-price-for-the-steiner-tree-problem-with-revenues-budget-and-hop-constraints/https://ac.tuwien.ac.at/publication/anwendung-von-kombinatorischen-optimierungsmethoden-zur-rekonstruktion-von-in-streifen-geschnittenen-papierdokumenten/Fri, 01 Jul 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/anwendung-von-kombinatorischen-optimierungsmethoden-zur-rekonstruktion-von-in-streifen-geschnittenen-papierdokumenten/https://ac.tuwien.ac.at/publication/optimierung-der-periodischen-tourenplanung-in-der-mullentsorgung/Fri, 01 Jul 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimierung-der-periodischen-tourenplanung-in-der-mullentsorgung/https://ac.tuwien.ac.at/publication/verbrauchsminimierung-eines-hybridfahrzeuges-im-neuen-europaischen-fahrzyklus/Fri, 01 Jul 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/verbrauchsminimierung-eines-hybridfahrzeuges-im-neuen-europaischen-fahrzyklus/https://ac.tuwien.ac.at/publication/a-timeslot-based-heuristic-approach-to-construct-high-school-timetables/Wed, 01 Dec 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-timeslot-based-heuristic-approach-to-construct-high-school-timetables/https://ac.tuwien.ac.at/publication/ein-neues-losungsarchiv-fur-das-generalized-minimum-spanning-tree-problem/Wed, 01 Sep 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-neues-losungsarchiv-fur-das-generalized-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/solving-the-k-node-minimum-label-spanning-arborescence-problem-with-exact-and-heuristic-methods/Sun, 01 Aug 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-k-node-minimum-label-spanning-arborescence-problem-with-exact-and-heuristic-methods/https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming-3/Thu, 01 Jul 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/automatic-generation-of-2-antwars-players-with-genetic-programming-3/https://ac.tuwien.ac.at/publication/multilevel-heuristiken-fur-das-rooted-delay-constrained-minimum-spanning-tree-problem/Thu, 01 Jul 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/multilevel-heuristiken-fur-das-rooted-delay-constrained-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/on-the-minimum-label-spanning-tree-problem-solution-methods-and-applications/Sat, 01 May 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-minimum-label-spanning-tree-problem-solution-methods-and-applications/https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-by-means-of-evolutionary-algorithms/Sat, 01 May 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-by-means-of-evolutionary-algorithms/https://ac.tuwien.ac.at/publication/solving-two-network-design-problems-by-mixed-integer-programming-and-hybrid-optimization-methods/Sat, 01 May 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-two-network-design-problems-by-mixed-integer-programming-and-hybrid-optimization-methods/https://ac.tuwien.ac.at/publication/compressing-fingerprint-templates-by-solving-the-k-node-minimum-label-spanning-arborescence-problem-by-branch-and-price/Mon, 01 Feb 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/compressing-fingerprint-templates-by-solving-the-k-node-minimum-label-spanning-arborescence-problem-by-branch-and-price/https://ac.tuwien.ac.at/publication/heuristic-methods-for-solving-two-generalized-network-problems/Mon, 01 Feb 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-methods-for-solving-two-generalized-network-problems/https://ac.tuwien.ac.at/publication/hybrid-optimization-methods-for-warehouse-logistics-and-the-reconstruction-of-destroyed-paper-documents/Tue, 01 Dec 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-optimization-methods-for-warehouse-logistics-and-the-reconstruction-of-destroyed-paper-documents/https://ac.tuwien.ac.at/publication/ein-losungsarchiv-unterstutzter-evolutionarer-algorithmus-fur-das-generalized-minimum-spanning-tree-problem/Wed, 01 Jul 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-losungsarchiv-unterstutzter-evolutionarer-algorithmus-fur-das-generalized-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-solving-the-bounded-diameter-minimum-spanning-tree-problem/Fri, 01 May 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-solving-the-bounded-diameter-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-basierend-auf-variabler-nachbarschaftssuche-und-dynamischer-programmierung-zur-tourenfindung-in-einem-ersatzteillager-mit-domanenspezifischen-nebenbedingungen/Wed, 01 Apr 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-basierend-auf-variabler-nachbarschaftssuche-und-dynamischer-programmierung-zur-tourenfindung-in-einem-ersatzteillager-mit-domanenspezifischen-nebenbedingungen/https://ac.tuwien.ac.at/publication/exakte-und-heuristische-optimierungsmethoden-zur-losung-von-video-server-load-re-balancing/Wed, 01 Apr 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/exakte-und-heuristische-optimierungsmethoden-zur-losung-von-video-server-load-re-balancing/https://ac.tuwien.ac.at/publication/event-based-similarity-search-and-its-applications-in-business-analytics/Sun, 01 Mar 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/event-based-similarity-search-and-its-applications-in-business-analytics/https://ac.tuwien.ac.at/publication/similarity-searching-in-complex-business-events-and-sequences-thereof/Sun, 01 Mar 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/similarity-searching-in-complex-business-events-and-sequences-thereof/https://ac.tuwien.ac.at/publication/enhancing-a-genetic-algorithm-by-a-complete-solution-archive-based-on-a-trie-data-structure/Sun, 01 Feb 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/enhancing-a-genetic-algorithm-by-a-complete-solution-archive-based-on-a-trie-data-structure/https://ac.tuwien.ac.at/publication/network-visualization-algorithms-applications-and-complexity/Sun, 01 Feb 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/network-visualization-algorithms-applications-and-complexity/https://ac.tuwien.ac.at/publication/design-eines-sicherheits-zeit-und-kostenkritischen-kommunikationsnetzwerkes-mittels-lagrange-relaxierung-und-spaltengenerierung/Mon, 01 Dec 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/design-eines-sicherheits-zeit-und-kostenkritischen-kommunikationsnetzwerkes-mittels-lagrange-relaxierung-und-spaltengenerierung/https://ac.tuwien.ac.at/publication/generierung-von-ein-und-umlagervorschlagen-in-lagern-mit-einer-last-in-first-out-strategie-und-kundenspezifischen-auslagerpraferenzen/Mon, 01 Dec 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/generierung-von-ein-und-umlagervorschlagen-in-lagern-mit-einer-last-in-first-out-strategie-und-kundenspezifischen-auslagerpraferenzen/https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-for-generalized-network-design-problems/Mon, 01 Dec 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/hybrid-metaheuristics-for-generalized-network-design-problems/https://ac.tuwien.ac.at/publication/parallel-variable-neighborhood-search-for-the-car-sequencing-problem/Wed, 01 Oct 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/parallel-variable-neighborhood-search-for-the-car-sequencing-problem/https://ac.tuwien.ac.at/publication/webbasierte-darstellung-grosser-datenmengen-als-pivot-tabelle-mithilfe-ressourcenoptimierter-aggregationsverfahren/Wed, 01 Oct 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/webbasierte-darstellung-grosser-datenmengen-als-pivot-tabelle-mithilfe-ressourcenoptimierter-aggregationsverfahren/https://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-zur-automatischen-rekonstruktion-von-handzerrissenen-dokumentenseiten-mittels-geometrischer-informationen/Mon, 01 Sep 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-hybrides-verfahren-zur-automatischen-rekonstruktion-von-handzerrissenen-dokumentenseiten-mittels-geometrischer-informationen/https://ac.tuwien.ac.at/publication/a-complete-archive-genetic-algorithm-for-the-multidimensional-knapsack-problem/Thu, 01 May 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-complete-archive-genetic-algorithm-for-the-multidimensional-knapsack-problem/https://ac.tuwien.ac.at/publication/an-incremental-dynamic-programming-approach-for-multidimensional-allocation-problems/Thu, 01 May 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-incremental-dynamic-programming-approach-for-multidimensional-allocation-problems/https://ac.tuwien.ac.at/publication/combinatorial-optimization-for-the-compression-of-biometric-templates/Thu, 01 May 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combinatorial-optimization-for-the-compression-of-biometric-templates/https://ac.tuwien.ac.at/publication/evaluation-and-reconstruction-of-strip-shredded-text-documents/Thu, 01 May 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/evaluation-and-reconstruction-of-strip-shredded-text-documents/https://ac.tuwien.ac.at/publication/lagrangian-relax-and-cut-and-hybrid-methods-for-the-bounded-diameter-and-the-hop-constrained-minimum-spanning-tree-problems/Thu, 01 May 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/lagrangian-relax-and-cut-and-hybrid-methods-for-the-bounded-diameter-and-the-hop-constrained-minimum-spanning-tree-problems/https://ac.tuwien.ac.at/publication/reconstructing-borders-of-manually-torn-paper-scheets-using-integer-linear-programming/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/reconstructing-borders-of-manually-torn-paper-scheets-using-integer-linear-programming/https://ac.tuwien.ac.at/publication/map-matching-und-wegsuche-in-einem-geografischen-informationssystem/Sat, 01 Dec 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/map-matching-und-wegsuche-in-einem-geografischen-informationssystem/https://ac.tuwien.ac.at/publication/algorithmic-approaches-to-the-string-barcoding-problem/Mon, 01 Oct 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithmic-approaches-to-the-string-barcoding-problem/https://ac.tuwien.ac.at/publication/subgradient-optimization-based-lagrangian-relaxation-and-relax-and-cut-approaches-for-the-bounded-diameter-minimum-spanning-tree-problem/Mon, 01 Oct 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/subgradient-optimization-based-lagrangian-relaxation-and-relax-and-cut-approaches-for-the-bounded-diameter-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/improved-protein-identification-after-fast-elimination-of-non-interpretable-peptide-ms-ms-spectra-and-noise-reduction/Tue, 01 May 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/improved-protein-identification-after-fast-elimination-of-non-interpretable-peptide-ms-ms-spectra-and-noise-reduction/https://ac.tuwien.ac.at/publication/metaheuristic-approaches-for-designing-survivable-fiber-optic-networks/Thu, 01 Mar 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/metaheuristic-approaches-for-designing-survivable-fiber-optic-networks/https://ac.tuwien.ac.at/publication/cluster-planarity-testing-for-the-case-of-not-necessarily-connected-clusters/Fri, 01 Dec 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/cluster-planarity-testing-for-the-case-of-not-necessarily-connected-clusters/https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-approach-combined-with-metaheuristics-for-the-knapsack-constrained-maximum-spanning-tree-problem/Sun, 01 Oct 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-lagrangian-decomposition-approach-combined-with-metaheuristics-for-the-knapsack-constrained-maximum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/solving-two-generalized-network-design-problems-with-exact-and-heuristic-methods/Mon, 01 May 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-two-generalized-network-design-problems-with-exact-and-heuristic-methods/https://ac.tuwien.ac.at/publication/an-ant-colony-optimisation-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-ant-colony-optimisation-algorithm-for-the-bounded-diameter-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/bestimmung-der-bahnelemente-von-extrasolaren-planeten-aufgrund-von-radialgeschwindigkeitsmessdaten-mittels-evolutionarer-algorithmen/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/bestimmung-der-bahnelemente-von-extrasolaren-planeten-aufgrund-von-radialgeschwindigkeitsmessdaten-mittels-evolutionarer-algorithmen/https://ac.tuwien.ac.at/publication/combining-metaheuristics-and-integer-programming-for-solving-cutting-and-packing-problems/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-metaheuristics-and-integer-programming-for-solving-cutting-and-packing-problems/https://ac.tuwien.ac.at/publication/automated-drawing-of-metro-maps/Mon, 01 Aug 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/automated-drawing-of-metro-maps/https://ac.tuwien.ac.at/publication/dynamische-reihenfolgeoptimierung-mittels-simulation-und-meta-heuristiken/Mon, 01 Aug 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/dynamische-reihenfolgeoptimierung-mittels-simulation-und-meta-heuristiken/https://ac.tuwien.ac.at/publication/eine-generische-bibliothek-fur-metaheuristiken-und-ihre-anwendung-auf-das-quadratic-assignment-problem/Mon, 01 Aug 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/eine-generische-bibliothek-fur-metaheuristiken-und-ihre-anwendung-auf-das-quadratic-assignment-problem/https://ac.tuwien.ac.at/publication/exact-and-heuristic-methods-for-solving-the-car-sequencing-problem/Mon, 01 Aug 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-methods-for-solving-the-car-sequencing-problem/https://ac.tuwien.ac.at/publication/multiple-structural-rna-alignment-with-affine-gap-costs-based-on-lagrangian-relaxation/Mon, 01 Aug 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/multiple-structural-rna-alignment-with-affine-gap-costs-based-on-lagrangian-relaxation/https://ac.tuwien.ac.at/publication/an-application-of-dijkstra-s-algorithm-for-a-on-board-route-re-planning-module/Fri, 01 Jul 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-application-of-dijkstra-s-algorithm-for-a-on-board-route-re-planning-module/https://ac.tuwien.ac.at/publication/an-extended-local-branching-framework-and-its-application-to-the-multidimensional-knapsack-problem/Tue, 01 Mar 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-extended-local-branching-framework-and-its-application-to-the-multidimensional-knapsack-problem/https://ac.tuwien.ac.at/publication/option-pricing-by-means-of-genetic-programming/Tue, 01 Feb 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/option-pricing-by-means-of-genetic-programming/https://ac.tuwien.ac.at/publication/ein-genetischer-algorithmus-fur-das-optimum-communication-spanning-tree-problem/Mon, 01 Nov 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-genetischer-algorithmus-fur-das-optimum-communication-spanning-tree-problem/https://ac.tuwien.ac.at/publication/an-alignment-graph-based-evolutionary-algorithm-for-the-multiple-sequence-alignment-problem/Sun, 01 Feb 2004 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-alignment-graph-based-evolutionary-algorithm-for-the-multiple-sequence-alignment-problem/https://ac.tuwien.ac.at/publication/ein-evolutionarer-algorithmus-zur-losung-des-vertex-biconnectivity-augmentation-problems/Mon, 01 Sep 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-evolutionarer-algorithmus-zur-losung-des-vertex-biconnectivity-augmentation-problems/https://ac.tuwien.ac.at/publication/neue-heuristische-losungsansatze-fur-das-multiple-sequence-alignment-problem/Thu, 01 May 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/neue-heuristische-losungsansatze-fur-das-multiple-sequence-alignment-problem/https://ac.tuwien.ac.at/publication/verfahren-zur-losung-eines-glasverschnittproblems/Thu, 01 May 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/verfahren-zur-losung-eines-glasverschnittproblems/https://ac.tuwien.ac.at/publication/ein-genetischer-algorithmus-fur-das-generalized-assignment-problem/Tue, 01 Apr 2003 00:00:00 +0000https://ac.tuwien.ac.at/publication/ein-genetischer-algorithmus-fur-das-generalized-assignment-problem/https://ac.tuwien.ac.at/publication/conjunctive-normal-forms-with-bounded-deficiency/Mon, 01 Jan 2001 00:00:00 +0000https://ac.tuwien.ac.at/publication/conjunctive-normal-forms-with-bounded-deficiency/https://ac.tuwien.ac.at/publication/progressives-adaptives-ray-tracing-von-bildern-mit-hoher-zeitlicher-koharenz/Sat, 01 Jan 1994 00:00:00 +0000https://ac.tuwien.ac.at/publication/progressives-adaptives-ray-tracing-von-bildern-mit-hoher-zeitlicher-koharenz/