The following pages link to Ulrich Pferschy (Q296977):
Displaying 50 items.
- The traveling group problem (Q2385125) (← links)
- The shortest connection game (Q2403801) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- Finding socially best spanning treesî (Q2430005) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- Allocating indivisible items with minimum dissatisfaction on preference graphs (Q2695444) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- The multiple subset sum problem (Q2706330) (← links)
- A two-period portfolio selection model for Asset-Backed Securitization (Q2867372) (← links)
- Two Agents Competing for a Shared Machine (Q2868541) (← links)
- The multidimensional knapsack problem: structure and algorithms (Q2899058) (← links)
- The Maximum Flow Problem with Conflict and Forcing Conditions (Q3091512) (← links)
- Approximating Multiobjective Knapsack Problems (Q3114821) (← links)
- (Q3126749) (← 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)
- Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals (Q3645303) (← links)
- Subset Weight Maximization with Two Competing Agents (Q3645306) (← links)
- Determining a Minimum Spanning Tree with Disjunctive Constraints (Q3645334) (← links)
- (Q4210638) (← links)
- (Q4233409) (← links)
- (Q4311199) (← links)
- (Q4370212) (← links)
- Greedy Algorithms for On-Line Data Compression (Q4373003) (← links)
- (Q4400850) (← links)
- Approximation schemes for ordered vector packing problems (Q4456057) (← links)
- (Q4492899) (← links)
- Personnel Planning with Multi-tasking and Structured Qualifications (Q4596254) (← links)
- Improved dynamic programming and approximation results for the knapsack problem with setups (Q4642123) (← links)
- (Q4778556) (← links)
- (Q4780784) (← links)
- (Q4821303) (← links)
- (Q4836291) (← links)
- Fair Packing of Independent Sets (Q5041187) (← links)
- The random linear bottleneck assignment problem (Q5101412) (← links)
- Minimization and maximization versions of the quadratic travelling salesman problem (Q5277951) (← links)
- A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks (Q5391762) (← links)
- ILP Models for a Nurse Scheduling Problem (Q5391796) (← links)
- On the Robust Knapsack Problem (Q5408207) (← links)
- The random linear bottleneck assignment problem (Q5689728) (← links)
- Algorithms - ESA 2003 (Q5897287) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- One-dimensional stock cutting resilient against singular random defects (Q6106587) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
- Corrigendum to: ``Integer optimization with penalized fractional values: the knapsack case'' (Q6109854) (← links)
- Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs (Q6116027) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)
- Fair allocation of indivisible items with conflict graphs (Q6337395) (← links)
