The following pages link to Markus Sinnl (Q323203):
Displaying 25 items.
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- The connected facility location polytope (Q1686059) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death (Q1699920) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- An exact solution framework for the minimum cost dominating tree problem (Q1800452) (← links)
- On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs (Q4602475) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- A matheuristic for tri-objective binary integer linear programming (Q6065590) (← links)
- A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
- An exact method for binary fortification games (Q6167322) (← links)
- Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)
- A branch-and-cut algorithm for submodular interdiction games (Q6364047) (← links)
