The following pages link to Michael R. Bussieck (Q537582):
Displaying 14 items.
- Algebraic modeling for IP and MIP (GAMS) (Q537584) (← links)
- (Q707687) (redirect page) (← links)
- Term-end exam scheduling at United States Military Academy/West Point (Q707689) (← links)
- The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311) (← links)
- Optimal lines for railway systems (Q1278454) (← links)
- Optimal scrap combination for steel production (Q1286779) (← links)
- Scheduling trams in the morning (Q1299930) (← links)
- Fast algorithms for the maximum convolution problem (Q1332943) (← links)
- (Q1365065) (redirect page) (← links)
- Discrete optimization in public rail transport (Q1365068) (← links)
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747) (← links)
- A fast algorithm for near cost optimal line plans (Q1762670) (← links)
- High-Performance Prototyping of Decomposition Methods in GAMS (Q4995054) (← links)
- Scheduling Commercial Videotapes in Broadcast Television (Q5321987) (← links)
