The following pages link to Markus Sinnl (Q323203):
Displaying 11 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)
- 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)
