The following pages link to Arie M. C. A. Koster (Q325444):
Displaying 19 items.
- On the computational complexity of the virtual network embedding problem (Q325446) (← links)
- A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks (Q339546) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- Comparative study of approximation algorithms and heuristics for SINR scheduling with power control (Q742414) (← links)
- Speeding up column generation for robust wireless network planning (Q743642) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Solving partial constraint satisfaction problems with tree decomposition (Q4785233) (← links)
- Frequency planning and ramifications of coloring (Q4786789) (← links)
- Contraction and Treewidth Lower Bounds (Q5301380) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Tight LP‐based lower bounds for wavelength conversion in optical networks (Q5422017) (← links)
- \(\Gamma\)-robust optimization of project scheduling problems (Q6065662) (← 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)
