Joachim Schauer

According to our database1, Joachim Schauer authored at least 28 papers between 2006 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Fair Packing of Independent Sets.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
The Product Knapsack Problem: Approximation and Complexity.
CoRR, 2019

Stackelberg Packing Games.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2018
Group activity selection problem with approval preferences.
Int. J. Game Theory, 2018

Order Batching and Routing in a Non-Standard Warehouse.
Electron. Notes Discret. Math., 2018

2017
Approximation of knapsack problems with conflict and forcing graphs.
J. Comb. Optim., 2017

The shortest connection game.
Discret. Appl. Math., 2017

On the Shortest Path Game.
Discret. Appl. Math., 2017

2016
Approximation of the Quadratic Knapsack Problem.
INFORMS J. Comput., 2016

Asymptotic behavior of the quadratic knapsack problem.
Eur. J. Oper. Res., 2016

2015
Maximizing Nash product social welfare in allocating indivisible goods.
Eur. J. Oper. Res., 2015

On the shortest path game: extended version.
CoRR, 2015

Personnel Planning with Multi-tasking and Structured Qualifications.
Proceedings of the Operations Research Proceedings 2015, 2015

2014
The Subset Sum game.
Eur. J. Oper. Res., 2014

The Shortest Path Game: Complexity and Algorithms.
Proceedings of the Theoretical Computer Science, 2014

A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign.
Proceedings of the Operations Research and Enterprise Systems, 2014

Media Mix Optimization - Applying a Quadratic Knapsack Model.
Proceedings of the ICORES 2014, 2014

2013
Job-shop scheduling in a body shop.
J. Sched., 2013

The maximum flow problem with disjunctive constraints.
J. Comb. Optim., 2013

Approximating the Quadratic Knapsack Problem on Special Graph Classes.
Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

2012
Group Activity Selection Problem.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

2011
Paths, trees and matchings under disjunctive constraints.
Discret. Appl. Math., 2011

The Maximum Flow Problem with Conflict and Forcing Conditions.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Resource allocation with time intervals.
Theor. Comput. Sci., 2010

2009
The Knapsack Problem with Conflict Graphs.
J. Graph Algorithms Appl., 2009

Combinatorial Optimization Problems with Conflict Graphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Determining a Minimum Spanning Tree with Disjunctive Constraints.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2006
ILP Models for a Nurse Scheduling Problem.
Proceedings of the Operations Research, 2006


  Loading...