The following pages link to Anita Schöbel (Q178535):
Displaying 50 items.
- (Q221645) (redirect page) (← links)
- Minmax robustness for multi-objective optimization problems (Q297049) (← links)
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (Q337170) (← links)
- The robust knapsack problem with queries (Q337391) (← links)
- A global optimization procedure for the location of a median line in the three-dimensional space (Q421608) (← links)
- Line planning in public transportation: models and methods (Q443830) (← links)
- Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances (Q454883) (← links)
- Locating an axis-parallel rectangle on a Manhattan plane (Q458948) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- Generalized light robustness and the trade-off between robustness and nominal quality (Q471020) (← links)
- Robust load planning of trains in intermodal transportation (Q480756) (← links)
- Improving the modulo simplex algorithm for large-scale periodic timetabling (Q502452) (← links)
- An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods (Q609566) (← links)
- Weber problems with high-speed lines (Q611010) (← links)
- Geometric fit of a point set by generalized circles (Q652655) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Minsum hyperspheres in normed spaces (Q713318) (← links)
- Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty (Q723948) (← links)
- The big cube small cube solution method for multidimensional facility location problems (Q733529) (← links)
- Locating a general minisum `circle' on the plane (Q766255) (← links)
- Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)
- Stop location design in public transportation networks: covering and accessibility objectives (Q845574) (← links)
- Optimization in public transportation. Stop location, delay management and tariff zone design in a public transportation network (Q853492) (← links)
- The path player game (Q1006556) (← links)
- Locating a minisum circle in the plane (Q1028414) (← links)
- Computing delay resistant railway timetables (Q1046699) (← links)
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- Locating lines and hyperplanes. Theory and algorithms (Q1282587) (← links)
- Solving restricted line location problems via a dual interpretation (Q1289029) (← links)
- Two characterizations of smooth norms (Q1306493) (← links)
- A note on center problems with forbidden polyhedra (Q1362521) (← links)
- Anchored hyperplane location problems (Q1404501) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Properties of three-dimensional median line location models (Q1413750) (← links)
- On center cycles in grid graphs (Q1413759) (← links)
- Dominance for multi-objective robust optimization concepts (Q1622793) (← links)
- The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← links)
- Decision uncertainty in multiobjective optimization (Q1679496) (← links)
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization (Q1713738) (← links)
- A general approach for the location of transfer points on a network with a trip covering criterion and mixed distances (Q1753405) (← links)
- A unified approach to uncertain optimization (Q1753451) (← links)
- A biobjective approach to recoverable robustness based on location planning (Q1753588) (← links)
- A geometric approach to global optimization (Q1819194) (← links)
- The price of multiobjective robustness: analyzing solution sets to uncertain multiobjective problems (Q2030735) (← links)
- The blockwise coordinate descent method for integer programs (Q2189480) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
- Location of speed-up subnetworks (Q2259045) (← links)
- Timetabling with passenger routing (Q2260893) (← links)
