https://ac.tuwien.ac.at/team/bin-hu/Bin HuHugo Blox Builder (https://hugoblox.com)en-usTue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pnghttps://ac.tuwien.ac.at/team/bin-hu/https://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/https://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands-2/https://ac.tuwien.ac.at/publication/solving-the-two-state-fixed-charge-transportation-problem-with-a-hybrid-genetic-algorithm/Sun, 01 Jan 2017 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-two-state-fixed-charge-transportation-problem-with-a-hybrid-genetic-algorithm/https://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-genetic-algorithm-in-combination-with-a-solution-archive-for-solving-the-generalized-vehicle-routing-problem-with-stochastic-demands/https://ac.tuwien.ac.at/publication/an-integer-l-shaped-method-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-integer-l-shaped-method-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/https://ac.tuwien.ac.at/publication/models-and-algorithms-for-competitive-facility-location-problems-with-different-customer-behavior/Fri, 01 Jan 2016 00:00:00 +0000https://ac.tuwien.ac.at/publication/models-and-algorithms-for-competitive-facility-location-problems-with-different-customer-behavior/https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-the-capacity-and-distance-constrained-plant-location-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-genetic-algorithm-for-the-capacity-and-distance-constrained-plant-location-problem/https://ac.tuwien.ac.at/publication/a-hybrid-genetic-algorithm-with-solution-archive-for-the-discrete-r-p-centroid-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-hybrid-genetic-algorithm-with-solution-archive-for-the-discrete-r-p-centroid-problem/https://ac.tuwien.ac.at/publication/a-new-solution-representation-for-the-firefighter-problem/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-new-solution-representation-for-the-firefighter-problem/https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-variable-neighborhood-search-for-the-generalized-vehicle-routing-problem-with-stochastic-demands/https://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/heuristic-approaches-for-the-probabilistic-traveling-salesman-problem-2/https://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/https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems-2/Thu, 01 Jan 2015 00:00:00 +0000https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems-2/https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-leader-follower-facility-location-problem-with-proportional-customer-behavior/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-for-the-leader-follower-facility-location-problem-with-proportional-customer-behavior/https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-analysis-of-path-relinking-and-recombination-within-a-grasp-hybrid/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-analysis-of-path-relinking-and-recombination-within-a-grasp-hybrid/https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-an-approach-for-the-dynamic-case/https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/Wed, 01 Jan 2014 00:00:00 +0000https://ac.tuwien.ac.at/publication/speeding-up-logic-based-benders-decomposition-by-a-metaheuristic-for-a-bi-level-capacitated-vehicle-routing-problem/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-partition-graph-coloring-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-partition-graph-coloring-problem/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-two-distinct-solution-representations-for-the-partition-graph-coloring-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-two-distinct-solution-representations-for-the-partition-graph-coloring-problem/https://ac.tuwien.ac.at/publication/a-mixed-integer-model-for-the-stamina-aware-sightseeing-tour-problem/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-mixed-integer-model-for-the-stamina-aware-sightseeing-tour-problem/https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-balancing-bicycle-sharing-systems/https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-the-static-balancing-of-public-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-pilot-vnd-grasp-hybrid-for-the-static-balancing-of-public-bicycle-sharing-systems/https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-a-variable-neighborhood-search-approach/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-a-variable-neighborhood-search-approach/https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-bicycle-sharing-systems-improving-a-vns-by-efficiently-determining-optimal-loading-operations/https://ac.tuwien.ac.at/publication/enhancing-a-genetic-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/enhancing-a-genetic-algorithm-with-a-solution-archive-to-reconstruct-cross-cut-shredded-text-documents/https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/pilot-grasp-and-vns-approaches-for-the-static-balancing-of-bicycle-sharing-systems/https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-with-a-genetic-algorithm-with-solution-archive/Tue, 01 Jan 2013 00:00:00 +0000https://ac.tuwien.ac.at/publication/reconstructing-cross-cut-shredded-documents-with-a-genetic-algorithm-with-solution-archive/https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem-2/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem-2/https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archives-and-bounding-extension-for-the-generalized-minimum-spanning-tree-problem/Sun, 01 Jan 2012 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archives-and-bounding-extension-for-the-generalized-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem/Sat, 01 Jan 2011 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-evolutionary-algorithm-with-solution-archive-for-the-generalized-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-population-management-for-the-generalized-minimum-vertex-biconnected-network-problem/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-with-population-management-for-the-generalized-minimum-vertex-biconnected-network-problem/https://ac.tuwien.ac.at/publication/enhancing-genetic-algorithms-by-a-trie-based-complete-solution-archive/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/enhancing-genetic-algorithms-by-a-trie-based-complete-solution-archive/https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search-2/Fri, 01 Jan 2010 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search-2/https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-generalized-minimum-vertex-biconnected-network-problem/Thu, 01 Jan 2009 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-memetic-algorithm-for-the-generalized-minimum-vertex-biconnected-network-problem/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/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem-2/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem-2/https://ac.tuwien.ac.at/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/effective-neighborhood-structures-for-the-generalized-traveling-salesman-problem/https://ac.tuwien.ac.at/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/Tue, 01 Jan 2008 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-railway-traveling-salesman-problem-via-a-transformation-into-the-classical-traveling-salesman-problem/https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-generalized-minimum-edge-biconnected-network-problem-efficient-neighborhood-structures-for-variable-neighborhood-search/https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/Mon, 01 Jan 2007 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-search-for-the-generalized-minimum-edge-biconnected-network-problem/https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/combining-variable-neighborhood-search-with-integer-linear-programming-for-the-generalized-minimum-spanning-tree-problem/https://ac.tuwien.ac.at/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/Sun, 01 Jan 2006 00:00:00 +0000https://ac.tuwien.ac.at/publication/variable-neighborhood-descent-with-self-adaptive-neighborhood-ordering/https://ac.tuwien.ac.at/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/Sat, 01 Jan 2005 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-generalized-minimum-spanning-trees-with-variable-neighborhood-search/