The following pages link to Joachim Schauer (Q296978):
Displaying 27 items.
- The Subset Sum game (Q296979) (← links)
- Maximizing Nash product social welfare in allocating indivisible goods (Q320030) (← links)
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- The maximum flow problem with disjunctive constraints (Q358660) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
- On the shortest path game (Q729795) (← links)
- Group activity selection problem with approval preferences (Q1621725) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- Approximating the product knapsack problem (Q2230782) (← links)
- The shortest connection game (Q2403801) (← links)
- Job-shop scheduling in a body shop (Q2434313) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- The Maximum Flow Problem with Conflict and Forcing Conditions (Q3091512) (← links)
- The Knapsack Problem with Conflict Graphs (Q3184613) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
- Approximating the Quadratic Knapsack Problem on Special Graph Classes (Q3188866) (← links)
- The Shortest Path Game: Complexity and Algorithms (Q3190149) (← links)
- Determining a Minimum Spanning Tree with Disjunctive Constraints (Q3645334) (← links)
- Personnel Planning with Multi-tasking and Structured Qualifications (Q4596254) (← links)
- Fair Packing of Independent Sets (Q5041187) (← links)
- ILP Models for a Nurse Scheduling Problem (Q5391796) (← links)
- Stackelberg packing games (Q5919312) (← links)
- Stackelberg packing games (Q5925607) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Fair allocation of indivisible items with conflict graphs (Q6337395) (← links)
