The following pages link to Ulrich Pferschy (Q296977):
Displaying 50 items.
- The Subset Sum game (Q296979) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- The maximum flow problem with disjunctive constraints (Q358660) (← links)
- Strategies in competing subset selection (Q367644) (← links)
- Committee selection under weight constraints (Q449043) (← links)
- Maximin fairness in project budget allocation (Q510932) (← links)
- Linear models and computational experiments for the quadratic TSP (Q510950) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- Paths, trees and matchings under disjunctive constraints (Q643009) (← links)
- Competitive subset selection with two agents (Q643027) (← links)
- Securitization of financial assets: approximation in theory and practice (Q702480) (← links)
- On the shortest path game (Q729795) (← links)
- Maximizing the minimum voter satisfaction on spanning trees (Q732928) (← links)
- A note on maximizing the minimum voter satisfaction on spanning trees (Q991324) (← links)
- Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← links)
- Modified subset sum heuristics for bin packing (Q1044695) (← links)
- A new fully polynomial time approximation scheme for the Knapsack problem (Q1304384) (← links)
- Linear programs with an additional rank two reverse convex constraint (Q1327432) (← links)
- Simple but efficient approaches for the collapsing knapsack problem (Q1364474) (← links)
- (Q1377279) (redirect page) (← links)
- Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) (← links)
- The inverse-parametric knapsack problem (Q1388831) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- A 3/4-approximation algorithm for multiple subset sum (Q1402509) (← links)
- Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- A PTAS for the multiple subset sum problem with different knapsack capacities (Q1607031) (← links)
- Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
- New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
- Approximation results for the incremental knapsack problem (Q1642685) (← links)
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- The core concept for the Multidimensional Knapsack problem (Q1742610) (← links)
- Competitive multi-agent scheduling with an iterative selection rule (Q1743639) (← links)
- Price of fairness for allocating a bounded resource (Q1752883) (← links)
- Improved dynamic programming in connection with an FPTAS for the knapsack problem (Q1768594) (← links)
- Stochastic analysis of greedy algorithms for the subset sum problem (Q1806779) (← links)
- Monge matrices make maximization manageable (Q1890948) (← links)
- The fractional greedy algorithm for data compression (Q1906680) (← links)
- Cardinality constrained bin-packing problems (Q1960326) (← links)
- Dynamic programming revisited: Improving knapsack algorithms (Q1969304) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- On the Stackelberg knapsack game (Q2029942) (← links)
- Optimally rescheduling jobs with a last-in-first-out buffer (Q2066687) (← links)
- Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem (Q2201319) (← links)
- Approximating the product knapsack problem (Q2230782) (← links)
- A Stackelberg knapsack game with weight control (Q2333816) (← links)
- Two agent scheduling with a central selection mechanism (Q2355710) (← links)
- Scheduling two agent task chains with a central selection mechanism (Q2356118) (← links)
- Generating subtour elimination constraints for the TSP from pure integer solutions (Q2358189) (← links)
