The following pages link to Marc Uetz (Q207375):
Displaying 50 items.
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
- On the complexity of a bundle pricing problem (Q657580) (← links)
- Machine scheduling with resource dependent processing times (Q877194) (← links)
- (Q957367) (redirect page) (← links)
- Optimal bundle pricing with monotonicity constraint (Q957368) (← links)
- Scheduling jobs with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
- When greediness fails: examples from stochastic scheduling. (Q1412702) (← links)
- The asymptotic price of anarchy for \(k\)-uniform congestion games (Q1644955) (← links)
- On the generation of circuits and minimal forbidden sets (Q1769072) (← links)
- On optimal mechanism design for a sequencing problem (Q2018936) (← links)
- In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
- In memoriam Gerhard Woeginger (1964--2022) (Q2157912) (← links)
- The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
- The sequential price of anarchy for affine congestion games with few players (Q2294284) (← links)
- Stochastic online scheduling on unrelated machines (Q2401160) (← links)
- The price of anarchy for utilitarian scheduling games on related machines (Q2419358) (← links)
- Analysis of Smith's rule in stochastic machine scheduling (Q2450731) (← links)
- Cooperative sequencing games with position-dependent learning effect (Q2661495) (← links)
- Scheduling precedence-constrained jobs with stochastic processing times on parallel machines (Q2768404) (← links)
- Efficiency of Equilibria in Uniform Matroid Congestion Games (Q2819451) (← links)
- The Price of Anarchy for Minsum Related Machine Scheduling (Q2896395) (← links)
- The Sequential Price of Anarchy for Atomic Congestion Games (Q2937005) (← links)
- Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types (Q2957467) (← links)
- Stochastic Scheduling on Unrelated Machines (Q2965523) (← links)
- Lower Bounds for Smith’s Rule in Stochastic Machine Scheduling (Q3075457) (← links)
- Mechanism Design for Decentralized Online Machine Scheduling (Q3100479) (← links)
- Solving Project Scheduling Problems by Minimum Cut Computations (Q3114838) (← links)
- Approximation in stochastic scheduling (Q3158561) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- Decomposition Algorithm for the Single Machine Scheduling Polytope (Q3195338) (← links)
- On the Complexity of the Highway Pricing Problem (Q3401111) (← links)
- The Curse of Sequentiality in Routing Games (Q3460793) (← links)
- How to Sell a Graph: Guidelines for Graph Retailers (Q3522949) (← links)
- Bundle Pricing with Comparable Items (Q3527236) (← links)
- LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times (Q3595396) (← links)
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times (Q3596345) (← links)
- Characterization of Revenue Equivalence (Q3627285) (← links)
- (Q4450519) (← links)
- (Q4664814) (← links)
- Two Dimensional Optimal Mechanism Design for a Sequencing Problem (Q4910820) (← links)
- Decentralized Throughput Scheduling (Q4924644) (← links)
- (Q4938774) (← links)
- (Q4941833) (← links)
- Corrigendum: Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q4958564) (← links)
- The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing (Q5108242) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- Optimal pricing of capacitated networks (Q5191131) (← links)
- Stochastic Machine Scheduling with Precedence Constraints (Q5317175) (← links)
- Models and Algorithms for Stochastic Online Scheduling (Q5387994) (← links)
- Pricing bridges to cross a river (Q5436961) (← links)
