The following pages link to Marc Goerigk (Q284437):
Displaying 50 items.
- A combined local search and integer programming approach to the traveling tournament problem (Q284438) (← links)
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
- Robust storage loading problems with stacking and payload constraints (Q323109) (← links)
- On the recoverable robust traveling salesman problem (Q331985) (← links)
- An experimental comparison of periodic timetabling models (Q336491) (← links)
- Branch and bound algorithms for the bus evacuation problem (Q336688) (← links)
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (Q337170) (← links)
- The robust knapsack problem with queries (Q337391) (← links)
- Robust flows with losses and improvability in evacuation planning (Q339930) (← links)
- A bicriteria approach to robust optimization (Q342179) (← links)
- Robust load planning of trains in intermodal transportation (Q480756) (← links)
- A robust bus evacuation model with delayed scenario information (Q480774) (← links)
- Improving the modulo simplex algorithm for large-scale periodic timetabling (Q502452) (← links)
- Investigating the recoverable robust single machine scheduling problem under interval uncertainty (Q833004) (← links)
- Algorithms and uncertainty sets for data-driven robust shortest path problems (Q1634306) (← links)
- On recoverable and two-stage robust selection problems with budgeted uncertainty (Q1681259) (← links)
- Ranking robustness and its application to evacuation planning (Q1681390) (← links)
- Variable-sized uncertainty and inverse problems in robust optimization (Q1694311) (← links)
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
- Compromise solutions for robust combinatorial optimization with variable-sized uncertainty (Q1750469) (← links)
- Line planning with user-optimal route choice (Q1751827) (← links)
- A biobjective approach to recoverable robustness based on location planning (Q1753588) (← links)
- The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
- On scenario aggregation to approximate robust combinatorial optimization problems (Q1800442) (← links)
- Solving robust two-stage combinatorial optimization problems under convex uncertainty (Q2050273) (← links)
- A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem (Q2084041) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- Flexible here-and-now decisions for two-stage multi-objective optimization: method and application to energy system design selection (Q2139143) (← links)
- Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
- Recoverable robust representatives selection problems with discrete budgeted uncertainty (Q2158008) (← links)
- Robust combinatorial optimization with locally budgeted uncertainty (Q2165591) (← links)
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion (Q2189877) (← links)
- Robust optimization for premarshalling with uncertain priority classes (Q2189929) (← links)
- Mixed uncertainty sets for robust combinatorial optimization (Q2192978) (← links)
- Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty (Q2197489) (← links)
- Combinatorial two-stage minmax regret problems under interval uncertainty (Q2241200) (← links)
- A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
- Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
- Two-stage combinatorial optimization problems under risk (Q2283029) (← links)
- On the complexity of robust geometric programming with polyhedral uncertainty (Q2294257) (← links)
- Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty (Q2312326) (← links)
- Representative scenario construction and preprocessing for robust combinatorial optimization problems (Q2329662) (← links)
- Alternative formulations for the ordered weighted averaging objective (Q2345860) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- Particle swarm metaheuristics for robust optimisation with implementation uncertainty (Q2664325) (← links)
- A compact reformulation of the two-stage robust resource-constrained project scheduling problem (Q2668660) (← links)
- Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming (Q2668793) (← links)
- Multistage robust discrete optimization via quantified integer programming (Q2669532) (← links)
- Combinatorial optimization problems with balanced regret (Q2685694) (← links)
- The price of robustness in timetable information (Q2917261) (← links)
