The following pages link to Stefan Gollowitzer (Q709180):
Displaying 10 items.
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities (Q2253496) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes (Q3091483) (← links)
- The Two Level Network Design Problem with Secondary Hop Constraints (Q3091484) (← links)
- New Models for and Numerical Tests of the Hamiltonian p-Median Problem (Q3091521) (← links)
- MIP Modeling of Incremental Connected Facility Location (Q3091533) (← links)
- A comparison of several models for the hamiltonian <i>p</i>‐median problem (Q4642484) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5891541) (← links)
