The following pages link to Stephan Westphal (Q283992):
Displayed 27 items.
- The online knapsack problem with incremental capacity (Q283993) (← links)
- A combined local search and integer programming approach to the traveling tournament problem (Q284438) (← links)
- A 5.875-approximation for the traveling tournament problem (Q475212) (← links)
- Interval scheduling on related machines (Q547142) (← links)
- Complexity of the traveling tournament problem (Q620946) (← links)
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines (Q632642) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- Pruning in column generation for service vehicle dispatching (Q940899) (← links)
- Approximation algorithms for a vehicle routing problem (Q953301) (← links)
- A note on the \(k\)-Canadian traveller problem (Q963338) (← links)
- New lower bounds for online \(k\)-server routing problems (Q987824) (← links)
- Online interval scheduling with a bounded number of failures (Q1707823) (← links)
- Approximation algorithms for \(\mathrm{TTP(2)}\) (Q1935936) (← links)
- Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution (Q2095749) (← links)
- A branch \& bound algorithm to determine optimal cross-splits for decision tree induction (Q2188762) (← links)
- An application of deterministic and robust optimization in the wood cutting industry (Q2342918) (← links)
- Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← links)
- An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths (Q2352354) (← links)
- Full implementation of social choice functions in dominant strategies (Q2424248) (← links)
- Complexity and approximability of the maximum flow problem with minimum quantities (Q2811300) (← links)
- A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items (Q2849904) (← links)
- MIP Formulations for Flowshop Scheduling with Limited Buffers (Q2999340) (← links)
- Approximating the Traveling Tournament Problem with Maximum Tour Length 2 (Q3060783) (← links)
- Maximum Generalized Assignment with Convex Costs (Q3195318) (← links)
- Online-Optimization of Large-Scale Vehicle Dispatching Problems (Q3439492) (← links)
- Competitive Algorithms for Cottage Rental (Q3439500) (← links)
- Online Job Admission (Q5192368) (← links)