The following pages link to Markus Sinnl (Q323203):
Displaying 43 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)
- An exact solution framework for the multiple gradual cover location problem (Q2003421) (← links)
- Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← links)
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- The generalized reserve set covering problem with connectivity and buffer requirements (Q2029278) (← links)
- A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem (Q2076862) (← links)
- Duplex encoding of staircase at-most-one constraints for the antibandwidth problem (Q2110406) (← links)
- Mixed-integer programming approaches for the time-constrained maximal covering routing problem (Q2241905) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
- An iterative exact algorithm for the weighted fair sequences problem (Q2676411) (← links)
- Optimal Upgrading Schemes for Effective Shortest Paths in Networks (Q2815128) (← links)
- A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem (Q2942688) (← links)
- Intersection Cuts for Bilevel Optimization (Q3186493) (← links)
- On the Asymmetric Connected Facility Location Polytope (Q3195346) (← 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)
- ILP and CP Formulations for the Lazy Bureaucrat Problem (Q5741471) (← 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)
