The following pages link to Günther R. Raidl (Q248083):
Displaying 50 items.
- Models and algorithms for competitive facility location problems with different customer behavior (Q276530) (← links)
- Metaheuristics for solving a multimodal home-healthcare scheduling problem (Q301481) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- A multi-commodity flow based model for multi layer hierarchical ring network design (Q325437) (← links)
- An integer L-shaped method for the generalized vehicle routing problem with stochastic demands (Q325450) (← links)
- (Q524885) (redirect page) (← links)
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem (Q524886) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems (Q887207) (← links)
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem (Q932219) (← links)
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- Evolutionary local search for the edge-biconnectivity augmentation problem (Q1603576) (← links)
- Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
- The core concept for the Multidimensional Knapsack problem (Q1742610) (← links)
- \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989) (← links)
- A beam search approach to the traveling tournament problem (Q2057120) (← links)
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (Q2117202) (← links)
- Learning surrogate functions for the short-horizon planning in same-day delivery problems (Q2117229) (← links)
- A beam search for the shortest common supersequence problem guided by an approximate expected length calculation (Q2163793) (← links)
- A learning large neighborhood search for the staff rerostering problem (Q2170207) (← links)
- A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three (Q2180685) (← links)
- A model for finding transition-minors (Q2192081) (← links)
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (Q2224853) (← links)
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources (Q2241156) (← links)
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (Q2289017) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search (Q2631244) (← links)
- Variable neighborhood search for integrated timetable based design of railway infrastructure (Q2631246) (← links)
- Boosting an exact logic-based Benders decomposition approach by variable neighborhood search (Q2631247) (← links)
- Models and algorithms for three-stage two-dimensional bin packing (Q2643961) (← links)
- On solving a generalized constrained longest common subsequence problem (Q2679772) (← links)
- On the use of decision diagrams for finding repetition-free longest common subsequences (Q2679779) (← links)
- Distributing battery swapping stations for electric scooters in an urban area (Q2679780) (← links)
- (Q2722077) (← links)
- (Q2770481) (← links)
- Strong lower bounds for a survivable network design problem (Q2883576) (← links)
- The multidimensional knapsack problem: structure and algorithms (Q2899058) (← links)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
- The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search (Q3057152) (← links)
- Hybrid Metaheuristics (Q3064566) (← links)
- Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints (Q3091491) (← links)
- Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem (Q3091493) (← links)
- A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem (Q3164899) (← links)
- On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem (Q3167627) (← links)
- A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem (Q3625008) (← links)
- (Q4472033) (← links)
