The following pages link to Arie M. C. A. Koster (Q325444):
Displaying 8 items.
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- Robust transshipment problem under consistent flow constraints (Q6180042) (← links)
- Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations (Q6496366) (← links)
- Robust two-dose vaccination schemes and the directed \(b\)-matching problem (Q6585275) (← links)
- Upper bounds and approximation results for the \(k\)-slow burning problem (Q6671389) (← links)
- Benchmark Instances for Robust Combinatorial Optimization with Budgeted Uncertainty (Q6699060) (← links)
- Efficient Implementation of a Novel Decomposition Approach for the Hazmat Network Design Problem with Capacity Constraints in Java Including Computational Results (Q6699085) (← links)
