The following pages link to Linus Schrage (Q537608):
Displaying 17 items.
- Broadening the integer programming audience, the LINDO perspective (Q537610) (← links)
- Conditions that cause risk pooling to increase inventory (Q1011228) (← links)
- (Q1247916) (redirect page) (← links)
- Branching from the largest upper bound. Folklore and facts (Q1247917) (← links)
- HOP: A software tool for production scheduling at Bridgestone/Firestone Off-The-Road (Q1303560) (← links)
- The power of linear programming: some surprising and unexpected LPs (Q2040605) (← links)
- Generalized filtering algorithms for infeasibility analysis (Q2459383) (← links)
- Scheduling training for a tank battalion: how to measure readiness (Q2462532) (← links)
- The global solver in the LINDO API (Q3396390) (← links)
- The Queue <i>M</i>/<i>G</i>/1 with the Shortest Remaining Processing Time Discipline (Q5524987) (← links)
- A Mixed-Priority Queue with Applications to the Analysis of Real-Time Systems (Q5568849) (← links)
- Letter to the Editor—An Alternative Proof of a Conservation Law for the Queue <i>G</i>/<i>G</i>/1 (Q5580086) (← links)
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case (Q5595978) (← links)
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline (Q5647712) (← links)
- Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case (Q5652427) (← links)
- Joint Pricing and Inventory Decisions for Constant Priced Items (Q5670420) (← links)
- Using decomposition in integer programming (Q5682152) (← links)
