The following pages link to Andreas S. Schulz (Q207373):
Displaying 50 items.
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank (Q408442) (← links)
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria (Q826114) (← links)
- Integer equal flows (Q833591) (← links)
- \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Switchbox routing in VLSI design: Closing the complexity gap (Q1274317) (← links)
- Base polytopes of series-parallel posets: Linear description and optimization (Q1290639) (← links)
- Improved bounds on relaxations of a parallel machine scheduling problem (Q1383802) (← links)
- Bounds on the Chvatal rank of polytopes in the 0/1-cube (Q1416165) (← links)
- The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001) (← links)
- Robust monotone submodular function maximization (Q1801019) (← links)
- On the Chvátal rank of polytopes in the 0/1 cube (Q1961231) (← links)
- Precedence-constrained scheduling and min-sum set cover (extended Abstract) (Q2193091) (← links)
- Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
- A geometric approach to the price of anarchy in nonatomic congestion games (Q2519480) (← links)
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure (Q2670463) (← links)
- (Q2712379) (← links)
- Single machine scheduling with release dates (Q2784510) (← links)
- The complexity of welfare maximization in congestion games (Q2892161) (← links)
- The Price of Anarchy of the Proportional Allocation Mechanism Revisited (Q2937750) (← links)
- Robust Appointment Scheduling (Q2969630) (← links)
- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming (Q2971619) (← links)
- Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands (Q3092266) (← links)
- Sharing Supermodular Costs (Q3098296) (← links)
- Solving Project Scheduling Problems by Minimum Cut Computations (Q3114838) (← links)
- Approximation in stochastic scheduling (Q3158561) (← links)
- On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games (Q3168999) (← links)
- Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling (Q3169127) (← links)
- Integer Programming: Optimization and Evaluation Are Equivalent (Q3183481) (← links)
- Robust Monotone Submodular Function Maximization (Q3186512) (← links)
- <i>ε</i> -optimization schemes and L-bit precision (extended abstract) (Q3192026) (← links)
- Fast, Fair, and Efficient Flows in Networks (Q3392070) (← links)
- Efficiency and fairness of system-optimal routing with user constraints (Q3418209) (← links)
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One (Q3541795) (← links)
- On the Rank of Cutting-Plane Proof Systems (Q3569838) (← links)
- On the Inefficiency of Equilibria in Congestion Games (Q3596363) (← links)
- Encouraging Cooperation in Sharing Supermodular Costs (Q3603471) (← links)
- (Q3840372) (← links)
- (Q4252434) (← links)
- (Q4263708) (← links)
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms (Q4361782) (← links)
- Approximation algorithms (Q4374975) (← links)
- (Q4471277) (← links)
- (Q4494463) (← links)
- Scheduling jobs with communication delays: Using infeasible solutions for approximation (Q4595479) (← links)
- Min-Sum Scheduling Under Precedence Constraints (Q4606348) (← links)
