# Stephan Westphal

According to our database

Collaborative distances:

^{1}, Stephan Westphal authored at least 36 papers between 2006 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2021

A branch & bound algorithm to determine optimal bivariate splits for oblique decision tree induction.

Appl. Intell., 2021

An Auction-based Mechanism for the Formation and Scheduling of Heterogeneous Human-machine Teams.

Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2021

2020

Big Data Cogn. Comput., 2020

A branch & bound algorithm to determine optimal cross-splits for decision tree induction.

Ann. Math. Artif. Intell., 2020

A Multi-Round Auction for Staff to Job Assignment Under Myopic Best Response Dynamics.

Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2020

2019

Int. J. Game Theory, 2019

Proceedings of the 5th International Conference on Vehicle Technology and Intelligent Transport Systems, 2019

2017

J. Sched., 2017

2016

Math. Methods Oper. Res., 2016

A combined local search and integer programming approach to the traveling tournament problem.

Ann. Oper. Res., 2016

A column generation approach for optimized routing and coordination of a UAV fleet.

Proceedings of the 2016 IEEE International Symposium on Safety, 2016

2015

An optimal randomized online algorithm for the k-Canadian Traveller Problem on node-disjoint paths.

J. Comb. Optim., 2015

Packing items into several bins facilitates approximating the separable assignment problem.

Inf. Process. Lett., 2015

An application of deterministic and robust optimization in the wood cutting industry.

4OR, 2015

2014

Interfaces, 2014

Ann. Oper. Res., 2014

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Proceedings of the Automated Scheduling and Planning - From Theory to Practice, 2013

Complexity and approximability of the maximum flow problem with minimum quantities.

Networks, 2013

A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items.

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Proceedings of the Fundamental Problems in Computing, 2013

2012

Math. Methods Oper. Res., 2012

2011

Theor. Comput. Sci., 2011

Comput. Oper. Res., 2011

Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines.

Comput. Oper. Res., 2011

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

2010

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Inf. Process. Lett., 2009

2008

Oper. Res. Lett., 2008

Math. Methods Oper. Res., 2008

Inf. Process. Lett., 2008

Ann. Oper. Res., 2008

Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem.

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

2006

Electron. Notes Discret. Math., 2006

Electron. Notes Discret. Math., 2006