The following pages link to Arie M. C. A. Koster (Q325444):
Displaying 50 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)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- The partial constraint satisfaction problem: Facets and lifting theorems (Q1306379) (← links)
- Stable multi-sets (Q1396917) (← links)
- Bidirected and unidirected capacity installation in telecommunication networks. (Q1417563) (← links)
- A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
- Polyhedral results for the edge capacity polytope. (Q1611010) (← links)
- Accurate optimization models for interference constrained bandwidth allocation in cellular networks (Q1628035) (← links)
- Lot sizing with storage losses under demand uncertainty (Q1631634) (← links)
- Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
- (Q1730608) (redirect page) (← links)
- A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
- The matching extension problem in general graphs is co-NP-complete (Q1743490) (← links)
- The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
- Robust flows over time: models and complexity results (Q1785195) (← links)
- On the burning number of \(p\)-caterpillars (Q2056898) (← links)
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
- An adaptive discretization algorithm for the design of water usage and treatment networks (Q2331361) (← links)
- On cycles and the stable multi-set polytope (Q2581319) (← links)
- Robust minimum cost flow problem under consistent flow constraints (Q2673801) (← links)
- (Q2741347) (← links)
- (Q2816028) (← links)
- On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration (Q2835659) (← links)
- On exact algorithms for treewidth (Q2933641) (← links)
- Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks (Q2940074) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks (Q3091480) (← links)
- Cutset Inequalities for Robust Network Design (Q3091492) (← links)
- Designing AC Power Grids Using Integer Linear Programming (Q3091532) (← links)
- Recoverable Robust Knapsacks: Γ-Scenarios (Q3091540) (← links)
- Comparing Imperfection Ratio and Imperfection Index for Graph Classes (Q3163670) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- On determining the imperfection ratio (Q3439498) (← 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)
